Sciweavers

280 search results - page 8 / 56
» Equivalence of Two Formal Semantics for Functional Logic Pro...
Sort
View
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
16 years 12 days ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
230
Voted
ICLP
2009
Springer
16 years 4 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
145
Voted
LISP
2007
124views more  LISP 2007»
15 years 3 months ago
A new generic scheme for functional logic programming with constraints
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
Francisco Javier López-Fraguas, Mario Rodr&...
129
Voted
ICFP
2008
ACM
16 years 3 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
KR
2000
Springer
15 years 7 months ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil