Typed Lambda Calculi and Applications

DOI10.1007/B135690zbMath1114.03009OpenAlexW2501230561MaRDI QIDQ5704009

Ken-etsu Fujita

Publication date: 11 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b135690

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Existential type systems between Church and Curry style (type-free style) ⋮ The existential fragment of second-order propositional intuitionistic logic is undecidable ⋮ Inhabitation of polymorphic and existential types ⋮ Type checking and typability in domain-free lambda calculi ⋮ Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence ⋮ Existential Type Systems with No Types in Terms ⋮ CPS-translation as adjoint

This page was built for publication: Typed Lambda Calculi and Applications