Sciweavers

525 search results - page 34 / 105
» Composing Programs in a Rewriting Logic for Declarative Prog...
Sort
View
OOPSLA
2007
Springer
14 years 1 months ago
No ifs, ands, or buts: uncovering the simplicity of conditionals
Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogona...
Jonathan Edwards
CC
2004
Springer
163views System Software» more  CC 2004»
14 years 1 months ago
Declarative Composition of Stack Frames
When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Christian Lindig, Norman Ramsey
FSTTCS
2000
Springer
13 years 11 months ago
Dynamically Ordered Probabilistic Choice Logic Programming
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, D...
Marina De Vos, Dirk Vermeir
LISP
2008
105views more  LISP 2008»
13 years 7 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
KSEM
2010
Springer
13 years 5 months ago
A Formalism for Causal Explanations with an Answer Set Programming Translation
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Yves Moinard