Applications of infinitary lambda calculus
From MaRDI portal
Publication:1021568
DOI10.1016/j.ic.2008.09.003zbMath1167.03010OpenAlexW1970779642MaRDI QIDQ1021568
Jan Willem Klop, Hendrik Pieter Barendregt
Publication date: 8 June 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2066/75183
Related Items (6)
Infinitary rewriting: closure operators, equivalences and models ⋮ A class of bounded functions, a database language and an extended lambda calculus ⋮ Simply typed fixpoint calculus and collapsible pushdown automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Clocked lambda calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional linearization
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Infinitary rewriting: meta-theory and convergence
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- 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
- Lambda calculus with explicit recursion
- Infinitary lambda calculus
- Descendants and origins in term rewriting.
- Transfinite reductions in orthogonal term rewriting systems
- Reduction Under Substitution
- Pairing Without Conventional Restraints
- Applications of Plotkin-terms: partitions and morphisms for closed terms
- Infinitary lambda calculi and böhm models
- Term Rewriting and Applications
- Recursive Functionals and Quantifiers of Finite Types II
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Applications of infinitary lambda calculus