Sciweavers

764 search results - page 90 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
14 years 11 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICTAC
2010
Springer
14 years 9 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
PPDP
2007
Springer
15 years 6 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
ESWS
2006
Springer
15 years 3 months ago
The Web Service Modeling Language WSML: An Overview
The Web Service Modeling Language (WSML) is a language for the specification of different aspects of Semantic Web Services. It provides a formal language for the Web Service Modeli...
Jos de Bruijn, Holger Lausen, Axel Polleres, Diete...
POPL
2012
ACM
13 years 7 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...