Terms for Efficient Proof Checking and Parsing-Reference-Cited by-同舟云学术

Terms for Efficient Proof Checking and Parsing

Published:2023-01-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Färber Michael¹

Affiliation:

1. University of Innsbruck, Austria

Funder

Austrian Science Fund

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3573105.3575686

Reference10 articles.

1. Ali Assaf . 2015. A framework for defining computational higher-order logics. (Un cadre de définition de logiques calculatoires d’ordre supérieur). Ph. D. Dissertation. École Polytechnique , Palaiseau, France . https://tel.archives-ouvertes.fr/tel-01235303 Ali Assaf. 2015. A framework for defining computational higher-order logics. (Un cadre de définition de logiques calculatoires d’ordre supérieur). Ph. D. Dissertation. École Polytechnique, Palaiseau, France. https://tel.archives-ouvertes.fr/tel-01235303

2. Ali Assaf Guillaume Burel Raphaël Cauderlier David Delahaye Gilles Dowek Catherine Dubois Frédéric Gilbert Pierre Halmagrand Olivier Hermant and Ronan Saillard. [n. d.]. Dedukti: a Logical Framework based on the λ Π -Calculus Modulo Theory. http://www.lsv.ens-cachan.fr/~dowek/Publi/expressing.pdf Ali Assaf Guillaume Burel Raphaël Cauderlier David Delahaye Gilles Dowek Catherine Dubois Frédéric Gilbert Pierre Halmagrand Olivier Hermant and Ronan Saillard. [n. d.]. Dedukti: a Logical Framework based on the λ Π -Calculus Modulo Theory. http://www.lsv.ens-cachan.fr/~dowek/Publi/expressing.pdf

3. Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

4. Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting