Sciweavers

280 search results - page 52 / 56
» Equivalence of Two Formal Semantics for Functional Logic Pro...
Sort
View
ICFP
2001
ACM
14 years 7 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
ICFP
1997
ACM
14 years 2 days ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary
TLDI
2003
ACM
121views Formal Methods» more  TLDI 2003»
14 years 1 months ago
Types for atomicity
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
Cormac Flanagan, Shaz Qadeer
FOIKS
2006
Springer
13 years 11 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
WWW
2007
ACM
14 years 8 months ago
From SPARQL to rules (and back)
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two ...
Axel Polleres