Sciweavers

1137 search results - page 85 / 228
» Partial Program Admission
Sort
View
ICFP
2001
ACM
14 years 10 months ago
Functioning without Closure: Type-Safe Customized Function Representations for Standard ML
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...
Allyn Dimock, Ian Westmacott, Robert Muller, Frank...
AAAI
1996
13 years 11 months ago
Splitting a Default Theory
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
Hudson Turner
PPDP
2007
Springer
14 years 4 months ago
Relational semantics for effect-based program transformations with dynamic allocation
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
AGP
1996
IEEE
14 years 2 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
KR
2004
Springer
14 years 3 months ago
A Causal Logic of Logic Programming
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...
Alexander Bochman