1020 search results - page 171 / 204 » Tight Semantics for Logic Programs |
POPL
2007
ACM
14 years 10 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
POPL
2003
ACM
14 years 10 months ago
2003
ACM
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...
POPL
2010
ACM
14 years 7 months ago
2010
ACM
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...
TKDE
2010
13 years 4 months ago
2010
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...
ENTCS
2006
13 years 10 months ago
2006
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...