Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICFP
2004
ACM

favoriteEmaildiscussreport

130views Programming Languages» more ICFP 2004»

Relating models of backtracking

14 years 4 months ago

Relating models of backtracking

Download www.ccs.neu.edu

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

Mitchell Wand, Dale Vaillancourt

Real-time Traffic

ICFP 2004 | Operational Semantics | Programming Languages | Subject Descriptors | Well-known Models |

claim paper

Related Content

» Selective backtracking of model changes

» 2Way vs dWay Branching for CSP

» Exploiting Causal Independence Using Weighted Model Counting

» Toward a Model for Backtracking and Dynamic Programming

» Forensic Analysis of File System Intrusions Using Improved Backtracking

» Leveraging Belief Propagation Backtrack Search and Statistics for Model Counting

» A genetic algorithm with backtracking for protein structure prediction

» Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference

» On the Relation between SAT and BDDs for Equivalence Checking

Post Info
More Details (n/a)

Added	13 Dec 2009
Updated	13 Dec 2009
Type	Conference
Year	2004
Where	ICFP
Authors	Mitchell Wand, Dale Vaillancourt

Comments (0)