Sciweavers

504 search results - page 4 / 101
» Definitional Reflection and the Completion
Sort
View
FOSSACS
2004
Springer
13 years 11 months ago
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban
IALP
2009
13 years 5 months ago
A Modular Cascaded Approach to Complete Parsing
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
Samar Husain, Phani Gadde, Bharat Ram Ambati, Dipt...
REFLECTION
2001
Springer
13 years 12 months ago
Template Metaprogramming an Object Interface to Relational Tables
Abstract. We present a general technique to support reflection in C++, exploiting template metaprogramming techniques. The technique is used for building an object interface to rel...
Giuseppe Attardi, Antonio Cisternino
MVA
1990
13 years 8 months ago
Extracting Shape and Reflectance of Glossy Surfaces by Using 3D Photometric Sampling Method
The photometric sampling method [4] extracts shape and reflectance properties of surfaces (Lambertian,specular,and hybrid)by using multipleillunrinationdirectionsand asingle viewi...
Hideichi Sato, Shree K. Nayar, Katsushi Ikeuchi