Sciweavers

1216 search results - page 47 / 244
» Hybrid type checking
Sort
View
SIGMOD
1989
ACM
153views Database» more  SIGMOD 1989»
15 years 3 months ago
Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference
Machiavelli is a polymorphically typed programming language in the spirit of ML, but supports an extended method of type inferencing that makes its polymorphism more general and a...
Atsushi Ohori, Peter Buneman, Val Tannen
ESOP
2007
Springer
15 years 6 months ago
Dependent Types for Low-Level Programming
In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that c...
Jeremy Condit, Matthew Harren, Zachary R. Anderson...
PPSWR
2004
Springer
15 years 5 months ago
Towards a Multi-calendar Temporal Type System for (Semantic) Web Query Languages
Abstract. Time is omnipresent on the (Semantic) Web. However, formalism like XML, XML Schema, RDF, OWL and (Semantic) Web query languages have, if any, only very limited notions of...
François Bry, Stephanie Spranger
FLOPS
2008
Springer
15 years 1 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
FOSSACS
2011
Springer
14 years 3 months ago
Irrelevance in Type Theory with a Heterogeneous Equality Judgement
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
Andreas Abel