1818 search results - page 55 / 364 » Granularity-Adaptive Proof Presentation |
APAL
2005
13 years 8 months ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
CORR
2000
Springer
13 years 8 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
BSL
1999
13 years 8 months ago
1999
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
TVCG
2010
13 years 7 months ago
2010
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...