1226 search results - page 19 / 246 » Proofs, Programs and Abstract Complexity |
130
click to vote
TLCA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
125
click to vote
TOPLAS
1998
15 years 1 months ago
1998
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
92
Voted
ESWS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
122
click to vote
POPL
2010
ACM
15 years 11 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...
159
click to vote
META
1992
15 years 6 months ago
1992
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...