loading...
Normalisation is Insensible to \lambda-Term Identity or Difference
Seattle, Washington August 12-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.3621st Annual IEEE Symposium on Logic i ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Makoto Tatsuta, National Institute of Informatics, Japan
Mariangiola Dezani-Ciancaglini, Dipartimento di Informatica, Italy
This paper analyses the computational behaviour of ?- term applications. The properties we are interested in are weak normalisation (i.e. there is a terminating reduction) and strong normalisation (i.e. all reductions are terminating).
Citation:
Makoto Tatsuta, Mariangiola Dezani-Ciancaglini, "Normalisation is Insensible to \lambda-Term Identity or Difference," lics, pp.327-338, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.