Sciweavers

1071 search results - page 70 / 215
» The Calculus of Algebraic Constructions
Sort
View
POPL
2004
ACM
16 years 6 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
WOLLIC
2010
Springer
15 years 11 months ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
A finiteness structure on resource terms
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
Thomas Ehrhard
CALCO
2009
Springer
161views Mathematics» more  CALCO 2009»
16 years 27 days ago
Free Heyting Algebras: Revisited
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...
Nick Bezhanishvili, Mai Gehrke
POPL
2005
ACM
16 years 6 months ago
From sequential programs to multi-tier applications by program transformation
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...
Matthias Neubauer, Peter Thiemann