Sciweavers

106 search results - page 7 / 22
» Specification of Logic Programming Languages from Reusable S...
Sort
View
LPNMR
1990
Springer
15 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
PLDI
2009
ACM
15 years 10 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...
ESOP
2009
Springer
15 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
94
Voted
FUIN
2008
116views more  FUIN 2008»
14 years 9 months ago
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
Jos de Bruijn, Stijn Heymans
91
Voted
ICFP
2005
ACM
15 years 9 months ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida