Sciweavers

18429 search results - page 95 / 3686
» Typing dynamic typing
Sort
View
POPL
1995
ACM
15 years 8 months ago
A Type System Equivalent to Flow Analysis
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
Jens Palsberg, Patrick O'Keefe
CORR
2010
Springer
158views Education» more  CORR 2010»
15 years 4 months ago
A Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
Mark Kaminski, Gert Smolka
ENTCS
2006
114views more  ENTCS 2006»
15 years 4 months ago
Towards Efficient, Typed LR Parsers
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
François Pottier, Yann Régis-Gianas
ACTA
2005
101views more  ACTA 2005»
15 years 4 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
ENTCS
2010
133views more  ENTCS 2010»
14 years 11 months ago
Inference of Session Types From Control Flow
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...
Peter Collingbourne, Paul H. J. Kelly