#### Filter Results:

#### Publication Year

2012

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Harley Eades, Aaron Stump
- 2013

Hereditary substitution is a form of type-bounded iterated substitution, first made explicit by Watkins et al. and Adams in order to show normalization of proof terms for various constructive logics. This paper is the first to apply hereditary substitution to show normalization of a type theory corresponding to a non-constructive logic, namely the λ… (More)

- Aaron Stump, Andrew Reynolds, Cesare Tinelli, Austin Laugesen, Harley Eades, Corey Oliver +1 other
- 2012

This paper presents work in progress on a new version, for public release, of the Logical Framework with Side Conditions (LFSC), previously proposed as a proof meta-format for SMT solvers and other proof-producing systems. The paper reviews the type-theoretic approach of LFSC, presents a new input syntax which hides the type-theoretic details for better… (More)

- Peng Fu, Fu, Aaron Stump, Cesare Tinelli, Kasturi R Varadarajan, Ted Herman +10 others
- 2016

To my mother Chen Xingzhen. ii ACKNOWLEDGEMENTS I would like to thank first of all my thesis advisor, Prof. Aaron Stump. Five years ago when I applied for graduate school, I asked him for recommendation on books in logic. He suggested Girard's proofs and types to me. It is not an ordinary book in logic and it introduces me to the Girard's works on System F,… (More)

- Peng Fu, Aaron Stump, Cesare Tinelli, Kasturi R Varadarajan, Ted Herman, Douglas W Jones +9 others
- 2014

Lambda encodings (such as Church encoding, Scott encoding and Parigot encoding) are methods to represent data in lambda calculus. Curry-Howard correspondence relates the formulas and proofs in intuitionistic logics to the types and programs in typed functional programming languages. Roughly speaking, Type theory (Intuitionistic Type Theory) formulates the… (More)

- David Pichardie, Tjark Weber, Jasmin Blanchette, Pascal Fontaine, Geoff Sutcliffe, Allen Van Gelder +23 others
- 2012

Preface The goal of the PxTP workshop series is to bring together researchers working on proof production from automated theorem provers with potential consumers of proofs. Machine-checkable proofs have been proposed for applications like proof-carrying code and certified compilation, as well as for exchanging knowledge between different automated reasoning… (More)

- ‹
- 1
- ›