Combining algebraic rewriting, extensional lambda calculi, and fixpoints
From MaRDI portal
Recommendations
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
- Adding algebraic rewriting to the untyped lambda calculus
- On modular properties of higher order extensional lambda calculi
- Publication:4205074
Cites work
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 176742 (Why is no real title available?)
- scientific article; zbMATH DE number 3573844 (Why is no real title available?)
- scientific article; zbMATH DE number 512797 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1761899 (Why is no real title available?)
- An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
- Combinatory reduction systems: Introduction and survey
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Developing developments
- On the implementation of abstract data types by programming language constructs
- Polymorphic rewriting conserves algebraic confluence
- Polymorphic rewriting conserves algebraic strong normalization
- Simulating expansions without expansions
- Some lambda calculi with categorical sums and products
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The virtues of eta-expansion
Cited in
(16)- Adding algebraic rewriting to the untyped lambda calculus
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- Foundations of Software Science and Computation Structures
- The simple type theory of normalisation by evaluation
- A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
- On modular properties of higher order extensional lambda calculi
- Logical foundations for hybrid type-logical grammars
- Abstract data type systems
- Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
- On the power of simple diagrams
- An insertion operator preserving infinite reduction sequences
- Termination of combined (rewrite and λ-calculus) systems
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
- Simulating expansions without expansions
- Canonicity of proofs in constructive modal logic
This page was built for publication: Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349901)
