Sciweavers

19 search results - page 2 / 4
» Canonicity for 2-dimensional type theory
Sort
View
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 5 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
SCP
2011
255views Communications» more  SCP 2011»
13 years 9 days ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ECCV
2004
Springer
13 years 10 months ago
A Fourier Theory for Cast Shadows
—Cast shadows can be significant in many computer vision applications, such as lighting-insensitive recognition and surface reconstruction. Nevertheless, most algorithms neglect ...
Ravi Ramamoorthi, Melissa L. Koudelka, Peter N. Be...
CIE
2007
Springer
13 years 11 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
ENTCS
2007
140views more  ENTCS 2007»
13 years 5 months ago
Admissible Representations of Probability Measures
In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 T...
Matthias Schröder