BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × Germany
1 × Poland
1 × Sweden
1 × United Kingdom
2 × Italy
7 × USA
Collaborated with:
C.Laneve J.Lévy H.G.Mairson P.Coppola S.Martini G.L.Ferrari R.Gorrieri W.Ricciotti C.S.Coen E.Tassi V.Danos L.Regnier
Talks about:
calculus (6) optim (5) reduct (4) elementari (2) interact (2) theorem (2) recurs (2) comput (2) share (2) graph (2)

Person: Andrea Asperti

DBLP DBLP: Asperti:Andrea

Contributed to:

LICS 20132013
CADE 20112011
POPL 20082008
POPL 20002000
ALP/PLILP 19981998
LICS 19981998
POPL 19981998
ICALP 19971997
POPL 19961996
RTA 19951995
TLCA 19951995
LICS 19941994
RTA 19931993
PLILP 19901990
POPL 19901990

Wrote 16 papers:

LICS-2013-AspertiL #cost analysis #λ-calculus
The Cost of Usage in the λ-Calculus (AA, JJL), pp. 293–300.
CADE-2011-AspertiRCT #interactive #proving #theorem proving
The Matita Interactive Theorem Prover (AA, WR, CSC, ET), pp. 64–69.
POPL-2008-Asperti #theorem
The intensional content of Rice’s theorem (AA), pp. 113–119.
POPL-2000-AspertiCM #recursion
(Optimal) Duplication is not Elementary Recursive (AA, PC, SM), pp. 96–107.
ALP-PLILP-1998-Asperti #functional #reduction
Optimal Reduction of Functional Expressions (AA), pp. 427–428.
LICS-1998-Asperti #logic
Light Affine Logic (AA), pp. 300–308.
POPL-1998-AspertiM #parallel #recursion #reduction
Parallel β Reduction is not Elementary Recursive (AA, HGM), pp. 303–315.
ICALP-1997-AspertiL #graph #on the
On the Dynamics of Sharing Graphs (AA, CL), pp. 259–269.
POPL-1996-Asperti #complexity #on the
On the Complexity of β-Reduction (AA), pp. 110–118.
RTA-1995-Asperti #exclamation #implementation #optimisation #λ-calculus
deltao!Epsilon = 1 — Optimizing Optimal λ-Calculus Implementations (AA), pp. 102–116.
TLCA-1995-AspertiL #graph #λ-calculus
Comparing λ-calculus translations in Sharing Graphs (AA, CL), pp. 1–15.
LICS-1994-AspertiDLR #λ-calculus
Paths in the λ-calculus (AA, VD, CL, LR), pp. 426–436.
RTA-1993-AspertiL #λ-calculus
Paths, Computations and Labels in the λ-Calculus (AA, CL), pp. 152–167.
PLILP-1990-Asperti #calculus #evaluation #lazy evaluation #strict
Integrating Strict and Lazy Evaluation: The λ-sl-Calculus (AA), pp. 238–254.
POPL-1990-AspertiFG #proving
Implicative Formulae in the “Proofs as Computations” Analogy (AA, GLF, RG), pp. 59–71.
TAPSOFT-1993-AspertiL #interactive #reduction
Optimal Reductions in Interaction Systems (AA, CL), pp. 485–500.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.