Sciweavers

10 search results - page 2 / 2
» Program Specialisation and Abstract Interpretation Reconcile...
Sort
View
PLILP
1992
Springer
13 years 9 months ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl
ICLP
1999
Springer
13 years 9 months ago
Algebra of Logic Programming
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
Silvija Seres, J. Michael Spivey, C. A. R. Hoare
JFP
2008
135views more  JFP 2008»
13 years 5 months ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
IWAN
1999
Springer
13 years 9 months ago
Policy Specification for Programmable Networks
There is a need to be able to program network components to adapt to application requirements for quality of service, specialised application dependent routing, to increase effici...
Morris Sloman, Emil Lupu
ICFP
2009
ACM
14 years 6 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg