Skew confluence and the lambda calculus with letrec
From MaRDI portal
Recommendations
- Confluence of the lambda calculus with left-linear algebraic rewriting
- On the confluence of lambda-calculus with conditional rewriting
- Foundations of Software Science and Computation Structures
- Label-selective -calculus syntax and confluence
- scientific article; zbMATH DE number 1354150
- Confluence of the coinductive \(\lambda\)-calculus
- The λ-calculus with constructors: Syntax, confluence and separation
- scientific article; zbMATH DE number 2044492
- The \(\lambda\)-context calculus
- Confluence via strong normalisation in an algebraic -calculus with rewriting
Cites work
- Applying dispersion correction to numerical approximations of the two‐dimensional wave equation ‐ eigenproblems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Explicit cyclic substitutions
- Explicit substitutions
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 3619855 (Why is no real title available?)
- scientific article; zbMATH DE number 1088036 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- scientific article; zbMATH DE number 786495 (Why is no real title available?)
- scientific article; zbMATH DE number 919844 (Why is no real title available?)
- scientific article; zbMATH DE number 937379 (Why is no real title available?)
- Infinitary lambda calculus
- Interaction Systems I: The theory of optimal reductions
- Lambda calculus with explicit recursion
- Order-incompleteness and finite lambda reduction models
- Relating graph and term rewriting via Böhm models
- Skew confluence and the lambda calculus with letrec
- The lambda calculus. Its syntax and semantics. Rev. ed.
Cited in
(19)- Lambda calculus with explicit recursion
- Skew confluence and the lambda calculus with letrec
- Computational soundness of a call by name calculus of recursively-scoped records
- Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
- 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
- scientific article; zbMATH DE number 1088036 (Why is no real title available?)
- Convergence in infinitary term graph rewriting systems is simple
- A syntactic model of mutation and aliasing
- Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
- Modules over monads and operational semantics (expanded version)
- Call-by-name extensionality and confluence
- A calculus of open modules: call-by-need strategy and confluence
- Explicit cyclic substitutions
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Towards Fast Nominal Anti-unification of Letrec-Expressions
- A rewriting theory for quantum -calculus
- An imperative pure calculus
- Compilation of extended recursion in call-by-value functional languages
This page was built for publication: Skew confluence and the lambda calculus with letrec
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849854)