Sciweavers

424 search results - page 44 / 85
» A Lambda Calculus with Forms
Sort
View
PLDI
2006
ACM
14 years 1 months ago
Continuations and transducer composition
On-line transducers are an important class of computational agent; we construct and compose together many software systems using them, such as stream processors, layered network p...
Olin Shivers, Matthew Might
PLDI
2005
ACM
14 years 1 months ago
Permission-based ownership: encapsulating state in higher-order typed languages
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...
Neelakantan R. Krishnaswami, Jonathan Aldrich
LACL
2001
Springer
14 years 1 days ago
Combinators for Paraconsistent Attitudes
Abstract. In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences ...
Jørgen Villadsen
ICFP
1999
ACM
13 years 12 months ago
Representing Java Classes in a Typed Intermediate Language
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
Christopher League, Zhong Shao, Valery Trifonov
FOCS
1998
IEEE
13 years 12 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov