scientific article; zbMATH DE number 512797
From MaRDI portal
Publication:4281490
Recommendations
Cited in
(20)- Combining algebraic rewriting, extensional lambda calculi, and fixpoints
- On the semantics of the universal quantifier
- Embedding of a free cartesian-closed category into the category of sets
- Developing developments
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Syntactic analysis of \(\eta\)-expansions in pure type systems.
- Curry-Howard-Lambek correspondence for intuitionistic belief
- On modular properties of higher order extensional lambda calculi
- A confluent reduction for the extensional typed -calculus with pairs, sums, recursion and terminal object
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Some lambda calculi with categorical sums and products
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
- On the power of simple diagrams
- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type
- Higher-order families
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
- Rewriting with extensional polymorphic \(\lambda \)-calculus
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus
- Factorize factorization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281490)