Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Higher-Order Polymorphic Lambda-Calculus With Sized Types
 

Summary: Slide 1
A Higher-Order Polymorphic Lambda-Calculus
With Sized Types
This is where the subtitle would have gone.
Andreas Abel
First APPSEM II Workshop
Nottingham, UK
March 28, 2003
| Work in progress |
Work supported by: PhD Prg. Logic in Computer Science, Munich (DFG)
Slide 2
Setting the stage. . .
 Curry-Howard-Isomorphism:
proofs by induction = programs with recursion
 Only terminating programs constitute valid proofs.
 Design issue: How to integrate terminating recursion into
proof/programming language?
1

Slide 3

  

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

 

Collections: Computer Technologies and Information Sciences