Result: Relating models of backtracking

Title:
Relating models of backtracking
Source:
Proceedings of the 2004 ACM SIGPLAN: International Conference on Functional Programming (ICFP'04), Snowbird, Utah, USA, September 19-21, 2004ACM SIGPLAN notices. 39(9):54-65
Publisher Information:
Broadway, NY: ACM, 2004.
Publication Year:
2004
Physical Description:
print, 22 ref
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
College of Computer and Information Science, Northeastern University, 360 Huntington Ave, Room 202 WVH, Boston, MA 02115, United States
ISSN:
1523-2867
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16196872
Database:
PASCAL Archive

Further Information

Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate higher-order values and infinite computations. We also provide an operational semantics, and we prove it adequate for both models.