Sciweavers

1003 search results - page 59 / 201
» Type Inference with Inequalities
Sort
View
LICS
1997
IEEE
15 years 8 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
122
Voted
SAS
2007
Springer
125views Formal Methods» more  SAS 2007»
15 years 10 months ago
A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages
Introducing aspect orientation to a polymorphically typed functional language strengthens the importance of type-scoped advices; i.e., advices with their effects being harnessed b...
Kung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Kh...
SAS
2005
Springer
134views Formal Methods» more  SAS 2005»
15 years 9 months ago
Using Dependent Types to Certify the Safety of Assembly Code
There are many source-level analyses or instrumentation tools that enforce various safety properties. In this paper we present an infrastructure that can be used to check independe...
Matthew Harren, George C. Necula
POPL
1999
ACM
15 years 8 months ago
Type-Safe Linking and Modular Assembly Language
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
Neal Glew, J. Gregory Morrisett
PPDP
2010
Springer
15 years 2 months ago
Typed and unambiguous pattern matching on strings using regular expressions
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator. We give a characterizatio...
Claus Brabrand, Jakob G. Thomsen