Sciweavers

3470 search results - page 327 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
LPNMR
1993
Springer
15 years 10 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
FOAL
2007
ACM
15 years 10 months ago
Requirement enforcement by transformation automata
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
Douglas R. Smith
ICFP
2010
ACM
15 years 7 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...
179
Voted
ICSE
2011
IEEE-ACM
14 years 10 months ago
Unifying execution of imperative and declarative code
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
Aleksandar Milicevic, Derek Rayside, Kuat Yessenov...
ICFP
2012
ACM
13 years 9 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride