A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem

DOI10.1016/0304-3975(92)90212-XzbMath0753.03009OpenAlexW2016191840MaRDI QIDQ1185009

György E. Révész

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90212-x

zbMATH Keywords

Church-Rosser property\(\lambda\)-calculus with lists

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Extensional proofs in a propositional logic modulo isomorphisms ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Infinitary affine proofs

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• An extension of lambda-calculus for functional programming
• Can programming be liberated from the von Neumann style?

This page was built for publication: A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem