✦ LIBER ✦

Type checking and typability in domain-free lambda calculi

✍ Scribed by Koji Nakazawa; Makoto Tatsuta; Yukiyoshi Kameyama; Hiroshi Nakano

Book ID: 113927460
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 324 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.06.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Type

[Lecture Notes in Computer Science] Typed Lambda Calculi and Applications Volume 664 || The undecidability of typability in the Lambda-Pi-calculus

✍ Bezem, Marc; Groote, Jan Friso 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 German ⚖ 304 KB

The Lambda Calculus Was Developed In The 1930s By Alonzo Church. The Calculus Turned Out To Be An Interesting Model Of Computation And Became Theprototype For Untyped Functional Programming Languages. Operational And Denotational Semantics For The Calculus Served As Examples For Otherprogramming Lan

Remarks on isomorphisms in typed lambda

Remarks on isomorphisms in typed lambda calculi with empty and sum types

✍ Marcelo Fiore; Roberto Di Cosmo; Vincent Balat 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 265 KB

[Lecture Notes in Computer Science] Type

[Lecture Notes in Computer Science] Typed Lambda Calculi and Applications Volume 664 || Lambda calculus characterizations of poly-time

✍ Bezem, Marc; Groote, Jan Friso 📂 Article 📅 1993 🏛 Springer-Verlag ⚖ 745 KB

[Lecture Notes in Computer Science] Type

[Lecture Notes in Computer Science] Typed Lambda Calculi and Applications Volume 4583 || Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

✍ Della Rocca, Simona Ronchi 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 387 KB

[Lecture Notes in Computer Science] Type

[Lecture Notes in Computer Science] Typed Lambda Calculi and Applications Volume 664 || Pure type systems formalized

✍ Bezem, Marc; Groote, Jan Friso 📂 Article 📅 1993 🏛 Springer-Verlag ⚖ 865 KB

[Lecture Notes in Computer Science] Type

[Lecture Notes in Computer Science] Typed Lambda Calculi and Applications Volume 5608 || Syntax for Free: Representing Syntax with Binding Using Parametricity

✍ Curien, Pierre-Louis 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 236 KB