Lambda calculus with explicit recursion

DOI10.1006/inco.1997.2651zbMath0892.68015OpenAlexW2088482003MaRDI QIDQ1383145

Jan Willem Klop, Zena M. Ariola

Publication date: 15 July 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1293

zbMATH Keywords

\(\lambda\)-calculus with explicit recursioncyclic \(\lambda\)-graphs

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Related Items (15)

Sharing in the Graph Rewriting Calculus ⋮ A concurrent lambda calculus with futures ⋮ Convergence in infinitary term graph rewriting systems is simple ⋮ A logical framework with higher-order rational (circular) terms ⋮ Safety of Nöcker's strictness analysis ⋮ A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case ⋮ Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) ⋮ Term-Graph Anti-Unification ⋮ Term graph rewriting ⋮ A calculus of open modules: call-by-need strategy and confluence ⋮ Deciding inclusion of set constants over infinite non-strict data structures ⋮ Applications of infinitary lambda calculus ⋮ Skew confluence and the lambda calculus with letrec ⋮ Towards a Sharing Strategy for the Graph Rewriting Calculus ⋮ Computational Soundness of a Call by Name Calculus of Recursively-scoped Records

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of a first-order functional language with sharing
• Algebraic approach to single-pushout graph transformation
• On graph rewritings
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Deforestation: Transforming programs to eliminate trees
• On ``On graph rewritings
• Combinatory reduction systems: Introduction and survey
• Infinitary lambda calculus
• LEAN: An intermediate language based on graph rewriting
• Transfinite reductions in orthogonal term rewriting systems
• Relating graph and term rewriting via Böhm models
• REDEX CAPTURING IN TERM GRAPH REWRITING
• A Transformation System for Developing Recursive Programs
• A new implementation technique for applicative languages
• Interaction Systems I: The theory of optimal reductions
• The call-by-need lambda calculus
• Explicit substitutions
• Explicit cyclic substitutions

This page was built for publication: Lambda calculus with explicit recursion