313 search results - page 26 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...