loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
Normalisation is Insensible to \lambda-Term Identity or Difference
Seattle, Washington
August 12-August 15
ISBN: 0-7695-2631-4
ASCII Text
x 
 
Makoto Tatsuta, Mariangiola Dezani-Ciancaglini, "Normalisation is Insensible to \lambda-Term Identity or Difference," Logic in Computer Science, Symposium on, pp. 327-338, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2006.36,
author = {Makoto Tatsuta and Mariangiola Dezani-Ciancaglini},
title = {Normalisation is Insensible to \lambda-Term Identity or Difference},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2006},
issn = {1043-6871},
pages = {327-338},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2006.36},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Normalisation is Insensible to \lambda-Term Identity or Difference
SN - 1043-6871
SP327
EP338
A1 - Makoto Tatsuta,
A1 - Mariangiola Dezani-Ciancaglini,
PY - 2006
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
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.