Sciweavers

1003 search results - page 41 / 201
» Type Inference with Inequalities
Sort
View
ESOP
1992
Springer
14 years 24 days ago
Dynamic Typing
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
Fritz Henglein
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
14 years 1 months ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 8 months ago
SchemaScope: a system for inferring and cleaning XML schemas
We present SchemaScope, a system to derive Document Type Definitions and XML Schemas from corpora of sample XML documents. Tools are provided to visualize, clean, and refine exist...
Geert Jan Bex, Frank Neven, Stijn Vansummeren
LICS
1993
IEEE
14 years 25 days ago
A lambda calculus of objects and method specialization
This paper presents an untyped lambda calculus, extended with object primitives that reflect the capabilities of so-called delegation-based object-oriented languages. A type infer...
John C. Mitchell, Furio Honsell, Kathleen Fisher
ECOOP
2010
Springer
14 years 1 months ago
Recency Types for Analyzing Scripting Languages
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
Phillip Heidegger, Peter Thiemann