Sciweavers

316 search results - page 26 / 64
» Subtyping Union Types
Sort
View
ACTA
1998
64views more  ACTA 1998»
14 years 9 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
LICS
2007
IEEE
15 years 4 months ago
Strong Normalization as Safe Interaction
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
Colin Riba
SWAT
1998
Springer
110views Algorithms» more  SWAT 1998»
15 years 1 months ago
On the Number of Regular Vertices of the Union of Jordan Regions
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
ESOP
2005
Springer
15 years 3 months ago
Towards a Type System for Analyzing JavaScript Programs
JavaScript is a popular language for client-side web scripting. It has a dubious reputation among programmers for two reasons. First, many JavaScript programs are written against a...
Peter Thiemann
WCRE
1998
IEEE
15 years 1 months ago
Type Inference for COBOL Systems
Types are a good starting point for various software reengineering tasks. Unfortunately, programs requiring reengineering most desperately are written in languages without an adeq...
Arie van Deursen, Leon Moonen