Clocks for Functional Programs
From MaRDI portal
Publication:5410452
DOI10.1007/978-3-642-40355-2_8zbMath1405.68058MaRDI QIDQ5410452
Jan Willem Klop, Dimitri Hendriks, Jörg Endrullis, Andrew Polonsky
Publication date: 16 April 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40355-2_8
68N18: Functional programming and lambda calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equal \(\mu \)-terms
- The lambda calculus. Its syntax and semantics. Rev. ed.
- LCF considered as a programming language
- Non-existent Statman's double fixed point combinator does not exist, indeed
- Descendants and origins in term rewriting.
- Highlights in infinitary rewriting and lambda calculus
- Infinitary Combinatory Reduction Systems: Confluence
- Term Rewriting and All That
- Clocked lambda calculus
- Discriminating Lambda-Terms Using Clocked Boehm Trees
- Programming in Haskell