Luigi Liquori | Institut National de Recherche en Informatique et Automatique (INRIA) (original) (raw)
Papers by Luigi Liquori
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ThŁse de Doctorat, UniversitØ de Turin, 1996
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2010
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1997
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1999
ABSTRACT
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1998
... In this paper, we apply four type systems to the functional Lambda Calculus of Objects: (a) t... more ... In this paper, we apply four type systems to the functional Lambda Calculus of Objects: (a) the Original type system [15]; (b) the Fisher's Ph.D type system [14]; (c) the Bruce's Matching-based type systems of Bono and Bugliesi [4], and (d) of Liquori [20]. ...
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1995
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2014
ABSTRACT We extend the constructive dependent type theory of the Logical Framework LF with a fami... more ABSTRACT We extend the constructive dependent type theory of the Logical Framework LF with a family of monads indexed by predicates over typed terms. These monads express the effect of factoring-out, postponing, or delegating to an external oracle the verification of a constraint or a side-condition. This new framework, called Lax Logical Framework, LaxF, is a conservative extension of LF, and hence it is the appropriate metalanguage for dealing formally with side-conditions or external evidence in logical systems. LaxF is the natural strengthening of LFp (the extension of LF introduced by the authors together with Marina Lenisa and Petar Maksimovic), which arises once the monadic nature of the lock constructors of LF p is fully exploited. The nature of these monads allows to utilize the unlock destructor instead of Moggi’s monadic letT , thus simplifying the equational theory. The rules for the unlock allow us, furthermore, to remove the monadic constructor once the constraint is satisfied. By way of example we discuss the encodings in LaxF of call-by-value λ-calculus, Hoare’s Logic, and Elementary Affine Logic.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ThŁse de Doctorat, UniversitØ de Turin, 1996
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2010
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1997
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1999
ABSTRACT
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1998
... In this paper, we apply four type systems to the functional Lambda Calculus of Objects: (a) t... more ... In this paper, we apply four type systems to the functional Lambda Calculus of Objects: (a) the Original type system [15]; (b) the Fisher's Ph.D type system [14]; (c) the Bruce's Matching-based type systems of Bono and Bugliesi [4], and (d) of Liquori [20]. ...
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1995
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2014
ABSTRACT We extend the constructive dependent type theory of the Logical Framework LF with a fami... more ABSTRACT We extend the constructive dependent type theory of the Logical Framework LF with a family of monads indexed by predicates over typed terms. These monads express the effect of factoring-out, postponing, or delegating to an external oracle the verification of a constraint or a side-condition. This new framework, called Lax Logical Framework, LaxF, is a conservative extension of LF, and hence it is the appropriate metalanguage for dealing formally with side-conditions or external evidence in logical systems. LaxF is the natural strengthening of LFp (the extension of LF introduced by the authors together with Marina Lenisa and Petar Maksimovic), which arises once the monadic nature of the lock constructors of LF p is fully exploited. The nature of these monads allows to utilize the unlock destructor instead of Moggi’s monadic letT , thus simplifying the equational theory. The rules for the unlock allow us, furthermore, to remove the monadic constructor once the constraint is satisfied. By way of example we discuss the encodings in LaxF of call-by-value λ-calculus, Hoare’s Logic, and Elementary Affine Logic.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact