ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
Constructing type systems over an operational semantics
Journal of Symbolic Computation
Computational foundations of basic recursive function theory
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Enhancing the NUPRL proof development system and applying it to computational abstract algebra
Enhancing the NUPRL proof development system and applying it to computational abstract algebra
Building reliable, high-performance communication systems from components
Proceedings of the seventeenth ACM symposium on Operating systems principles
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Distributed Algorithms
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Semantic Foundations for Embedding HOL in Nuprl
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability)
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Hybrid Interactive Theorem Proving Using Nuprl and HOL
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Dependent Intersection: A New Way of Defining Records in Type Theory
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Inductive definition in type theory
Inductive definition in type theory
Type-theoretic methodology for practical programming languages
Type-theoretic methodology for practical programming languages
The metaprl logical programming environment
The metaprl logical programming environment
Building reliable, high-performance networks with the Nuprl proof development system
Journal of Functional Programming
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Verified Protection Model of the seL4 Microkernel
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
A Brief Overview of Agda --- A Functional Language with Dependent Types
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Application of theorem proving to problem solving
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Communications of the ACM
Extracting programs from constructive HOL proofs via IZF set-theoretic semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Automating proofs in category theory
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hi-index | 0.00 |
In this article I will examine a few key concepts and design decisions that account for the high value of implemented constructive type theories in computer science. I'll stress the historical fact that these theories, and the proof assistants that animate them, were born from a strong partnership linking computer science, logic, and mathematics. I will recall how modern type theory researchers built on deep insights from the earliest pioneers: Turing--the first computer scientist, Church--the patriarch of logic in computer science, and Brouwer--a singular pioneer of intuitionism and constructive mathematics. They created solid intellectual ground on which to build a formal implemented constructive theory of computation whose influence will be felt well beyond computing and information science alone. All generations of constructive type theory researchers since this beginning have had leaders from all three disciplines. Much of the seminal modern work creating these type theories and their proof assistants was presented in LICS proceedings, and LICS could be a natural home for future work in this flourishing area which is the epitome of logic in computer science.