Lambda calculus with explicit recursion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3907750 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 177452 (Why is no real title available?)
- scientific article; zbMATH DE number 1231468 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1479633 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 919844 (Why is no real title available?)
- scientific article; zbMATH DE number 234028 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A Transformation System for Developing Recursive Programs
- A new implementation technique for applicative languages
- Algebraic approach to single-pushout graph transformation
- Combinatory reduction systems: Introduction and survey
- Deforestation: Transforming programs to eliminate trees
- Explicit cyclic substitutions
- Explicit substitutions
- Infinitary lambda calculus
- Interaction Systems I: The theory of optimal reductions
- LEAN: An intermediate language based on graph rewriting
- On ``On graph rewritings
- On graph rewritings
- Properties of a first-order functional language with sharing
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Relating graph and term rewriting via Böhm models
- The call-by-need lambda calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Transfinite reductions in orthogonal term rewriting systems
Cited in
(20)- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
- Lambda calculus with patterns
- A calculus of open modules: call-by-need strategy and confluence
- Sharing in the graph rewriting calculus
- Expressibility in the lambda calculus with \(\mu\)
- Term-graph anti-unification
- A concurrent lambda calculus with futures
- Safety of Nöcker's strictness analysis
- Applications of infinitary lambda calculus
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus
- Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)
- Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
- Skew confluence and the lambda calculus with letrec
- Term graph rewriting
- Deciding inclusion of set constants over infinite non-strict data structures
- Explicit cyclic substitutions
- A logical framework with higher-order rational (circular) terms
- Convergence in infinitary term graph rewriting systems is simple
- Computational soundness of a call by name calculus of recursively-scoped records
- Towards a sharing strategy for the graph rewriting calculus
This page was built for publication: Lambda calculus with explicit recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383145)
