activity
20102019
most citedSemantics of Typed Lambda-Calculus with Constructors

7 citations · 18 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LO2019★ 1 cited

Lambda Congruences and Extensionality

Michele Basaldella

In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free an…

cs.LO2015

Ludics without Designs I: Triads

Michele Basaldella

In this paper, we introduce the concept of triad. Using this notion, we study, revisit, discover and rediscover some basic properties of ludics from a very general point of view.

cs.LO2014

Infinitary Classical Logic: Recursive Equations and Interactive Semantics

Michele Basaldella

In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled…

cs.LO2011★ 6 cited

Ludics with repetitions (Exponentials, Interactive types and Completeness)

Claudia Faggian, Michele Basaldella

Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behav…

cs.LO2010★ 4 cited

On the meaning of logical completeness

Michele Basaldella, Kazushige Terui

Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. O…

cs.LO2010★ 7 cited

Semantics of Typed Lambda-Calculus with Constructors

Barbara Petit

We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-ca…