Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Semi-continuous Sized Types and Termination Termination Checking via Type Systems
 

Summary: Semi-continuous Sized Types and Termination
Termination Checking via Type Systems
Andreas Abel
Department of Computer Science
Ludwig-Maximilians-University Munich
Computer Science Logic 2006
Szeged, Hungary
September 26, 2006
Andreas Abel (LMU Munich) Semi-continuous Sized Types CSL'06 1 / 21
Introduction
Theorem Provers for Constructive Logic
Theorem Provers built on Dependent Type Theory:
Coq (INRIA, France)
Epigram (Nottingham, UK)
Agda (Chalmers, Sweden)
Their soundness is based on termination.
Andreas Abel (LMU Munich) Semi-continuous Sized Types CSL'06 2 / 21
Introduction
Constructive Logics
The Curry-Howard Isomorphism:

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences