Global ETD Search

Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos

Jiménez Millán, José Antonio2003

… we demostrate the Inversion Principle and the Curry-Howard isomorphism for the ND calculus. Then, we introduce two new conversion algorithms between the proofs in LC and the deductions in ND and thus, we get one semantic labelling in LC. We propose this labelling as the definition of equality …

cadiz Repository record for Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos (opens in a new tab)

Interactive theorem provers: issues faced as a user and tackled as a developer

Tassi, Enrico <1980>Alma Mater Studiorum - Università di Bologna2008

… used system like Coq. Matita is based on the Curry-Howard isomorphism, adopting the Calculus of Inductive Constructions (CIC) as its logical foundation. Proof objects are thus, at some extent, compatible with the ones produced with the Coq ITP, that is itself able to import and process the …

bologna Repository record for Interactive theorem provers: issues faced as a user and tackled as a developer (opens in a new tab)

The Nax Language: Unifying Functional Programming and Logical Reasoning in a Language based on Mendler-style Recursion Schemes and Term-indexed Types

Ahn, Ki Yung

portland-state Repository record for The Nax Language: Unifying Functional Programming and Logical Reasoning in a Language based on Mendler-style Recursion Schemes and Term-indexed Types (opens in a new tab)