Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Dybjer, Peter - Department of Computer Science and Engineering, Chalmers University of Technology
A Brief Overview of Agda A Functional Language with Dependent Types
The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories
Verifying Haskell Programs by Combining Testing and Proving Peter Dybjer Qiao Haiyan Makoto Takeyama
Dependent Types at Work Lecture Notes for the LerNet Summer School
Indexed Induction-Recursion Peter Dybjer a,
Embedding a Logical Theory of Constructions in Agda Ana Bove Peter Dybjer
Formal Neighbourhoods, Combinatory Bohm Trees,
Constructive Type Theory Interactive Theorem Proving
On the Algebraic Foundation of Proof Assistants
Normalization by evaluation for typed lambda calculus with coproducts
Project: Type-Checker with explicit substitution The project is to write an type-checker for V 2 V in Haskell. The main problem
An intuitionistic theory of types Per Martin-Lof
Categorical Logic in Computer Science II Basic Research Action
Towards Formalizing Categorical Models of Type Theory in Type Theory
The Biequivalence of Locally Cartesian Closed Categories
Proglog seminar, 25 October 2006 Howard, Lawvere, and Scott Martin-Lf Lawvere again After 1986
ProgrmaYerification in a l~gical Theory of Constructions Peter Dybjer
