Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/7058
Nаziv: | Lambda calculus with types | Аutоri: | Barendregt H. Dekkers W. Statman R. Alessi F. Bezem M. Cardone F. Coppo M. Dezani-Ciancaglini M. Dowek G. Gilezan, Silvia Honsell F. Moortgat M. Severi P. Urzyczyn P. |
Dаtum izdаvаnjа: | 1-јан-2011 | Čаsоpis: | Lambda Calculus with Types | Sažetak: | © Association for Symbolic Logic 2013. This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. in this book, the authors focus on three classes of typing for lambda terms: Simple types, recursive types and intersection types. it is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types. | URI: | https://open.uns.ac.rs/handle/123456789/7058 | ISBN: | 9781139032636 | DOI: | 10.1017/CBO9781139032636 |
Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
68
prоvеrеnо 10.05.2024.
Prеglеd/i stаnicа
58
Prоtеklа nеdеljа
14
14
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.