Sciweavers

227 search results - page 41 / 46
» A Model Theory for Paraconsistent Logic Programming
Sort
View
JLP
2010
85views more  JLP 2010»
13 years 3 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
POPL
2004
ACM
14 years 8 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
POPL
2005
ACM
14 years 8 months ago
Enterprise privacy promises and enforcement
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
Adam Barth, John C. Mitchell
PLDI
2003
ACM
14 years 1 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume