Relating models of backtracking

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. Categories and Subject Descriptors D.3.1 [Programming Languages]: Formal Definitions and Theory; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages--Denotational seman

• Type: Conference
• Year: 2004
• Where: ICFP
• Authors: Mitchell Wand, Dale Vaillancourt
• Keywords: ICFP 2004, Operational Semantics, Programming Languages, Subject Descriptors, Well-known Models