Sciweavers

245 search results - page 4 / 49
» On Isomorphisms of Intersection Types
Sort
View
TCS
2008
13 years 5 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol
TLCA
2009
Springer
13 years 12 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
SMI
1999
IEEE
116views Image Analysis» more  SMI 1999»
13 years 9 months ago
Intersecting Surfaces of Special Types
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
Myung-Soo Kim
FOCS
2002
IEEE
13 years 10 months ago
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
Vikraman Arvind, Piyush P. Kurur