Sciweavers

4211 search results - page 235 / 843
» Types as Abstract Interpretations
Sort
View
TLCA
2009
Springer
15 years 11 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
ICCS
2004
Springer
15 years 10 months ago
Extending Camelot with Mutable State and Concurrency
Abstract. Camelot is a resource-bounded functional programming language which compiles to Java byte code to run on the Java Virtual Machine. We extend Camelot to include language s...
Stephen Gilmore
TCC
2004
Springer
835views Cryptology» more  TCC 2004»
15 years 10 months ago
On the Possibility of One-Message Weak Zero-Knowledge
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
Boaz Barak, Rafael Pass
CAISE
2003
Springer
15 years 10 months ago
Exploiting Generalization for the Composition of Transformations of XML Schema Based Documents
Abstract. Open exchange of electronic documents in XML formats frequently requires the transformation to different XML-Schemas or DTDs (document type description). We propose a tr...
Marek Lehmann
LICS
1996
IEEE
15 years 9 months ago
A Linear Logical Framework
We present the linear type theory LLF as the forThis extended abstract will appear on the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science -LICS'...
Iliano Cervesato, Frank Pfenning