Sciweavers

330 search results - page 19 / 66
» Intersection and Union Types
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
15 years 2 months ago
Formalizing Type Operations Using the "Image" Type Constructor
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...
Aleksey Nogin, Alexei Kopylov
ICFP
1999
ACM
15 years 6 months ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
Atsushi Ohori, Nobuaki Yoshida
HOA
1993
15 years 6 months ago
Strong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
Steffen van Bakel, Maribel Fernández
94
Voted
ESOP
2003
Springer
15 years 7 months ago
Type Error Slicing in Implicitly Typed Higher-Order Languages
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
Christian Haack, J. B. Wells
133
Voted
RTA
2007
Springer
15 years 8 months ago
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
Kentaro Kikuchi