Constructions: A Higher Order Proof System for Mechanizing Mathematics

History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation

Empty types in polymorphic lambda calculus

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Extracting &ohgr;'s programs from proofs in the calculus of constructions

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

A representation of Lambda terms suitable for operations on their intensions

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming

A framework for defining logics

Journal of the ACM (JACM)

Inductive-data-type systems

Theoretical Computer Science - Special issue on theories of types and proofs

"Type" is not a type

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Using Decision Procedures with a Higher-Order Logic

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics

Formalizing the Trading Theorem for the Classification of Surfaces

TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics

Higher-Order Intuitionistic Formalization and Proofs in Hilbert's Elementary Geometry

ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry

Safe, Untrusted Agents Using Proof-Carrying Code

Mobile Agents and Security

Hardware Verification Using Co-induction in COQ

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics

Some logical and syntactical observations concerning the first-order dependent type system λP

Mathematical Structures in Computer Science

Automated complexity analysis of Nuprl extracted programs

Journal of Functional Programming

The open verifier framework for foundational verifiers

TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation

Formalizing generalized maps in Coq

Theoretical Computer Science

Formalizing the trading theorem in Coq

Theoretical Computer Science

The Open Calculus of Constructions (Part I): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving

Fundamenta Informaticae

Concoqtion: indexed types now!

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Design and formal proof of a new optimal image segmentation program with hypermaps

Pattern Recognition

Computation with classical sequents

Mathematical Structures in Computer Science

Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof

Theoretical Computer Science

An Intuitionistic Proof of a Discrete Form of the Jordan Curve Theorem Formalized in Coq with Combinatorial Hypermaps

Journal of Automated Reasoning

Syntax for Free: Representing Syntax with Binding Using Parametricity

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications

Unembedding domain-specific languages

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell

Finding unity in computational logic

Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference

Modeling Contexts with Dependent Types

Fundamenta Informaticae

The Open Calculus of Constructions (Part I): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving

Fundamenta Informaticae

A complete proof system for propositional projection temporal logic

Theoretical Computer Science

A type-theoretical approach for ontologies: The case of roles

Applied Ontology