Proof normalisation in a logic identifying isomorphic propositions
From MaRDI portal
Publication:5089014
Recommendations
Cites work
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 733666 (Why is no real title available?)
- scientific article; zbMATH DE number 7356679 (Why is no real title available?)
- A Filter Model for Concurrent $\lambda$-Calculus
- A System F accounting for scalars
- A relational semantics for parallelism and non-determinism in a functional setting
- A short survey of isomorphisms of types
- Homotopy type theory. Univalent foundations of mathematics
- Lambda-calculi for (strict) parallel functions
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- Linearity in the non-deterministic call-by-value setting
- Linearity, non-determinism and solvability
- Mechanizing metatheory without typing contexts
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- On the expressive power of schemes
- Proof normalization modulo
- Provable isomorphisms of types
- Retrieving library identifiers via equational matching of types
- The algebraic lambda calculus
- The calculus of constructions
- The vectorial \(\lambda\)-calculus
- Theorem proving modulo
Cited in
(5)- Functional pearl: the distributive \(\lambda\)-calculus
- A new connective in natural deduction, and its application to quantum computing
- A new connective in natural deduction, and its application to quantum computing
- Extensional proofs in a propositional logic modulo isomorphisms
- A quick overview on the quantum control approach to the lambda calculus
This page was built for publication: Proof normalisation in a logic identifying isomorphic propositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089014)