Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/7058
Назив: | Lambda calculus with types | Аутори: | 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. |
Датум издавања: | 1-јан-2011 | Часопис: | Lambda Calculus with Types | Сажетак: | © 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 |
Налази се у колекцијама: | FTN Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
68
проверено 10.05.2024.
Преглед/и станица
58
Протекла недеља
14
14
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.