Sciweavers

1445 search results - page 37 / 289
» Abstract Interpretation of Logic Programs
Sort
View
LICS
1994
IEEE
15 years 1 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
94
Voted
ICFP
2010
ACM
14 years 10 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
ESOP
1990
Springer
15 years 1 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy
FGCS
1992
107views more  FGCS 1992»
14 years 11 months ago
Logic Programming, Abduction and Probability
Probabilistic Horn abduction is a simple framework to combine probabilistic and logical reasoning into a coherent practical framework. The numbers can be consistently interpreted ...
David Poole
CONCUR
2005
Springer
15 years 3 months ago
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
Eric Goubault, Emmanuel Haucourt