Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Normalization by evaluation for 2 Thorsten Altenkirch1
 

Summary: Normalization by evaluation for 2
Thorsten Altenkirch1
and Tarmo Uustalu2
1
School of Computer Science and IT, University of Nottingham
Nottingham NG8 1BB, United Kingdom
txa@cs.nott.ac.uk
2
Institute of Cybernetics, Tallinn Technical University
Akadeemia tee 21, EE-12618 Tallinn, Estonia
tarmo@cs.ioc.ee
Abstract. We show that the set-theoretic semantics for 2
is complete
by inverting evaluation using decision trees. This leads to an implemen-
tation of normalization by evaluation which is witnessed by the source of
part of this paper being a literate Haskell script. We show the correctness
of our implementation using logical relations.
1 Introduction
Which is the simplest typed -calculus without uninterpreted base types or type
variables? We suggest that the answer should be 2

  

Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham

 

Collections: Computer Technologies and Information Sciences