Clocked lambda calculus

DOI10.1017/S0960129515000389zbMath1387.03013arXiv1405.7500OpenAlexW3104111471MaRDI QIDQ5269007

Jörg Endrullis, Jan Willem Klop, Andrew Polonsky, Dimitri Hendriks

Publication date: 14 June 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.7500

zbMATH Keywords

lambda calculusBöhm treesclocked lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (1)

Clocks for Functional Programs

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The absence and the presence of fixed point combinators
• Applications of infinitary lambda calculus
• An extensional treatment of dataflow deadlock
• LCF considered as a programming language
• Full abstraction in the lazy lambda calculus
• Non-existent Statman's double fixed point combinator does not exist, indeed
• Infinitary lambda calculus
• Descendants and origins in term rewriting.
• Infinitary Combinatory Reduction Systems: Confluence
• A-translation and looping combinators in pure type systems
• Algebraic semantics and complexity of term rewriting systems
• Discriminating Lambda-Terms Using Clocked Boehm Trees

This page was built for publication: Clocked lambda calculus