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 × Germany
1 × Hungary
1 × Italy
1 × The Netherlands
1 × United Kingdom
2 × France
Collaborated with:
S.Abramsky P.D.Gianantonio F.Honsell
Talks about:
coinduct (3) calculus (3) complet (3) semant (3) type (3) equival (2) calculi (2) system (2) model (2) fulli (2)

Person: Marina Lenisa

DBLP DBLP: Lenisa:Marina

Contributed to:

CSL 20132013
FoSSaCS 20082008
CSL 20012001
CSL 20002000
FoSSaCS 19991999
TLCA 19971997
TLCA 19951995

Wrote 8 papers:

CSL-2013-GianantonioL #game studies #semantics
Innocent Game Semantics via Intersection Type Assignment Systems (PDG, ML), pp. 231–247.
FoSSaCS-2008-GianantonioHL #higher-order #λ-calculus
RPO, Second-Order Contexts, and λ-Calculus (PDG, FH, ML), pp. 334–349.
CSL-2001-AbramskyL #modelling #λ-calculus
Fully Complete Minimal PER Models for the Simply Typed λ-Calculus (SA, ML), pp. 443–457.
CSL-2000-AbramskyL #ml #polymorphism
A Fully Complete PER Model for ML Polymorphic Types (SA, ML), pp. 140–155.
FoSSaCS-1999-Lenisa #bisimulation #equivalence #induction #logic
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.
TLCA-1997-Lenisa #induction #semantics #λ-calculus
Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for λ-calculi (ML), pp. 248–266.
TLCA-1995-HonsellL #semantics #λ-calculus
Final Semantics for untyped λ-calculus (FH, ML), pp. 249–265.
TAPSOFT-1997-Lenisa #induction #proving #λ-calculus
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi (ML), pp. 309–320.

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.