Sciweavers

1055 search results - page 178 / 211
» On the Semantics of Logic Programs with Preferences
Sort
View
POPL
2003
ACM
14 years 9 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
POPL
2010
ACM
14 years 6 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
TKDE
2010
161views more  TKDE 2010»
13 years 3 months ago
A Deductive Spreadsheet System for End Users
We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-bas...
Marcelo Tallis, Robert M. Balzer
ENTCS
2006
123views more  ENTCS 2006»
13 years 9 months ago
Nonmonotonic Trust Management for P2P Applications
Community decisions about access control in virtual communities are non-monotonic in nature. This means that they cannot be expressed in current, monotonic trust management langua...
Marcin Czenko, Ha Tran, Jeroen Doumen, Sandro Etal...
IEE
2008
115views more  IEE 2008»
13 years 9 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller