- Types Summer School Gothenburg Sweden August 2005
- Types for Proofs and Programs Third Annual Meeting
- Types for Proofs and Programs Third Annual Meeting
- An Extensible Proof Text Editor Thomas Hallgren and Aarne Ranta ?
- PROCEEDINGS OF THE SECOND WORKSHOP ON
- Department of Computing Science Purely Functional Processes
- 1 Introduction 1 1.1 Using type theory for programming . . . . . . . . . . . . . . . . . 3
- PROCEEDINGS OF THE 1992 WORKSHOP ON
- Department of Computing Science Purely Functional Processes
- PROCEEDINGS OF THE FIRST WORKSHOP ON
- ESPRIT Working Group Proposal TYPES
- INFORMAL PROCEEDINGS OF THE 1993 WORKSHOP ON
- Programming in MartinLof's Type Theory
- Towards a Theory of Document Structure Bengt Nordstrom
- Petition to the European Parliament From 1997, the European Patent Office has initiated and generalised the granting of patents for
- formalization of mathematics Freek Wiedijk
- Constructivism. A Computing Science perspective \Lambda
- Multilingual Syntax Editing in GF Janna Khegai, Bengt Nordstrom, and Aarne Ranta
- Terminating General Recursion \Lambda Bengt Nordstrom
- A simple type-theoretic language: Mini-TT Thierry Coquand
- Types for Proofs and Programs Coordination Action
- Types for Proofs and Programs Coordination Action
- MartinL#f's Type Theory B. Nordstr#m, K. Petersson and J. M. Smith
- Programming in Constructive Set Theory: Some Examples Bengt NordstrOm
- Martin-Lof's Type Theory B. Nordstrom, K. Petersson and J. M. Smith
- Constructivism. A Computing Science perspective
- A user's guide to ALF \Lambda Thorsten Altenkirch Veronica Gaspes Bengt Nordstrom
- Programming in Martin-Lof's Type Theory
- Software illustrating a unified approach to multimodality and multilinguality in the
- Theoretical background Coq co-induction and co-recursion
- Writing a Mizar article in nine easy steps
- Formal Proofs Computer Arithmetics
- Introduction to Lambda Calculus Henk Barendregt Erik Barendsen
- The QED Manifesto May 15, 1994
- The ALF proof editor and its proof engine ? Lena Magnusson and Bengt Nordstrom
- Types for Proofs and Programs Coordination Action
- Bishop's set theory1 Erik Palmgren
- Guarded Recursion in Dependent Type Theory
- Type Theory and Programming \Lambda Thierry Coquand Bengt Nordstrom Jan M. Smith
- Introduction Direct method Use of dependent types Modules and functors Coq tutorial
- Introduction to the Why tool Jean-Christophe Filli^atre
- Proof of normalisation using domain theory Thierry Coquand and Arnaud Spivak
- User Guide: the extract tool (v1.0Beta4)
- Functional Morphology Markus Forsberg and Aarne Ranta
- Functional Morphology User manual
- Functional Morphology Markus Forsberg
- Types Summer School Gothenburg Sweden August 2005
- A formally verified proof of the prime number theorem
- Types Summer School Gothenburg Sweden August 2005
- Types Summer School Gothenburg Sweden August 2005
- Alexandre Miquel PPS & U. Paris 7 Alexandre.Miquel@pps.jussieu.fr
- Normalisation of Second Order Arithmetic Alexandre Miquel PPS & U. Paris 7
- Types Summer School, Hisingen 2005 Brouwer-Heyting-Kolmogorov Curry-Howard Martin-Lof Proof editing
- An idea coming from ... higher-order substitution (Russell, Withehead, Church, Curry,
- Catarina Coquand August 16, 2005
- A Compact Introduction to Isabelle/HOL Tobias Nipkow
- Isabelle/HOL Exercises 1 Counting occurences
- CoInduction in Coq Yves Bertot
- Types Summer School Gothenburg Sweden August 2005
- Types Summer School Gothenburg Sweden August 2005
- A formally verified proof of the prime number theorem
- SIXTH FRAMEWORK PROGRAMME Information Society Technologies
- Types for Proofs and Programs Coordination Action
- Types for Proofs and Programs Coordination Action
- Types for Proofs and Programs Coordination Action
- GoTAL 2008: Programme Chalmers University
- Enhanced Multimodal Grammar Library Peter Ljunglf Gabriel Amores Hkan Burden
- Integrating multiple modalities into SLMs and parsing the output of SLMs
- Decision Procedures 1: Survey of decision procedures
- Acc Acc
- TYPES Summer School 2005 Proofs of Programs
- Parsing Linear Context-Free Rewriting Systems Hkan Burden
- Inconsistent Type Systems Alexandre Miquel PPS & U. Paris 7
- The Labelled BNF Grammar Formalism Markus Forsberg, Aarne Ranta
