Pages that link to "Item:Q4322432"

The following pages link to Simulating expansions without expansions (Q4322432):

Displaying 11 items.

• Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060) (← links)
• Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
• Developing developments (Q1392147) (← links)
• A Local Graph-rewriting System for Deciding Equality in Sum-product Theories (Q2867904) (← links)
• Normal Higher-Order Termination (Q2946769) (← links)
• A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object (Q4630299) (← links)
• Combining first order algebraic rewriting systems, recursion and extensional lambda calculi (Q4632448) (← links)
• Some lambda calculi with categorical sums and products (Q5055791) (← links)
• On the power of simple diagrams (Q5055861) (← links)
• The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
• Extensional proofs in a propositional logic modulo isomorphisms (Q6052705) (← links)