Clocks for Functional Programs

DOI10.1007/978-3-642-40355-2_8MaRDI QIDQ5410452zbMATH OpenOpenAlexFDO

Authors Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, 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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites work

• scientific article; zbMATH DE number 6678680 (Why is no real title available?)
• scientific article; zbMATH DE number 5852776 (Why is no real title available?)
• scientific article; zbMATH DE number 5318491 (Why is no real title available?)
• scientific article; zbMATH DE number 3928339 (Why is no real title available?)
• scientific article; zbMATH DE number 952103 (Why is no real title available?)
• scientific article; zbMATH DE number 919844 (Why is no real title available?)
• A coinductive framework for infinitary rewriting and equational reasoning
• Clocked lambda calculus
• Descendants and origins in term rewriting.
• Discriminating lambda-terms using clocked Böhm trees
• Highlights in infinitary rewriting and lambda calculus
• Infinitary combinatory reduction systems: confluence
• LCF considered as a programming language
• Non-existent Statman's double fixed point combinator does not exist, indeed
• On equal -terms
• Programming in Haskell
• Term Rewriting and All That
• The lambda calculus. Its syntax and semantics. Rev. ed.

This page was built for publication: Clocks for Functional Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410452)