default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarina Lenisa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Furio Honsell, Marina Lenisa, Ivan Scagnetto:
Principal Types as Partial Involutions. CoRR abs/2402.07230 (2024)- 2022
- [c44]Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone:
On Quantitative Algebraic Higher-Order Theories. FSCD 2022: 4:1-4:18 - [i2]Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone:
On Quantitative Algebraic Higher-Order Theories. CoRR abs/2204.13654 (2022) - 2021
- [c43]Pietro Di Gianantonio, Marina Lenisa:
Principal Types as Lambda Nets. TYPES 2021: 5:1-5:23 - 2020
- [c42]Furio Honsell, Marina Lenisa, Ivan Scagnetto:
Λ-Symsym: An Interactive Tool for Playing with Involutions and Types. TYPES 2020: 7:1-7:18
2010 – 2019
- 2019
- [j14]Fabio Alessi, Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, Ivan Scagnetto:
LF+ in Coq for "fast and loose" reasoning. J. Formaliz. Reason. 12(1): 11-51 (2019) - [c41]Alberto Ciaffaglione, Pietro Di Gianantonio
, Furio Honsell, Marina Lenisa, Ivan Scagnetto:
lambda!-calculus, Intersection Types, and Involutions. FSCD 2019: 15:1-15:16 - [c40]Fabio Alessi, Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning. LFMTP@LICS 2019: 8-23 - 2018
- [c39]Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto:
The involutions-as-principal types/application-as-unification Analogy. LPAR 2018: 254-270 - [i1]Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto:
Linear lambda-calculus and Reversible Automatic Combinators. CoRR abs/1806.06759 (2018) - 2016
- [j13]Furio Honsell, Marina Lenisa, Ivan Scagnetto, Luigi Liquori, Petar Maksimovic:
An open logical framework. J. Log. Comput. 26(1): 293-335 (2016) - [c38]Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto:
Implementing Cantor's Paradise. APLAS 2016: 229-250 - 2015
- [j12]Marina Lenisa:
Multigames and strategies, coalgebraically. Theor. Comput. Sci. 604: 46-62 (2015) - 2014
- [j11]Furio Honsell, Marina Lenisa, Daniel Pellarini:
Categories of Coalgebraic Games with Selective Sum. Fundam. Informaticae 134(3-4): 395-414 (2014) - [c37]Marina Lenisa:
Coalgebraic Multigames. CMCS 2014: 33-49 - 2013
- [c36]Furio Honsell, Marina Lenisa:
Unfixing the Fixpoint: The Theories of the λY-Calculus. Computation, Logic, Games, and Quantum Foundations 2013: 150-165 - [c35]Pietro Di Gianantonio, Marina Lenisa:
Innocent Game Semantics via Intersection Type Assignment Systems. CSL 2013: 231-247 - 2012
- [j10]Furio Honsell, Marina Lenisa, Rekha Redamalla:
Equivalences and Congruences on Infinite Conway Games. RAIRO Theor. Informatics Appl. 46(2): 231-259 (2012) - [c34]Furio Honsell, Marina Lenisa, Rekha Redamalla:
Categories of Coalgebraic Games. MFCS 2012: 503-515 - 2011
- [j9]Furio Honsell, Marina Lenisa:
Conway games, algebraically and coalgebraically. Log. Methods Comput. Sci. 7(3) (2011) - 2010
- [c33]Pietro Di Gianantonio, Svetlana Jaksic, Marina Lenisa:
Efficient Bisimilarities from Second-Order Reaction Semantics for pi-Calculus. CONCUR 2010: 358-372
2000 – 2009
- 2009
- [j8]Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
RPO, Second-order Contexts, and Lambda-calculus. Log. Methods Comput. Sci. 5(3) (2009) - [c32]Furio Honsell, Marina Lenisa:
Conway Games, Coalgebraically. CALCO 2009: 300-316 - [e4]Alexander Kurz, Marina Lenisa, Andrzej Tarlecki:
Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. Lecture Notes in Computer Science 5728, Springer 2009, ISBN 978-3-642-03740-5 [contents] - 2008
- [j7]Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
A type assignment system for game semantics. Theor. Comput. Sci. 398(1-3): 150-169 (2008) - [c31]Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
RPO, Second-Order Contexts, and lambda-Calculus. FoSSaCS 2008: 334-349 - [c30]Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto:
A Conditional Logical Framework. LPAR 2008: 143-157 - [c29]Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi. WADT 2008: 119-134 - 2007
- [j6]Furio Honsell, Marina Lenisa, Rekha Redamalla:
Coalgebraic description of generalised binary methods. Math. Struct. Comput. Sci. 17(4): 647-673 (2007) - [c28]Furio Honsell, Marina Lenisa, Luigi Liquori:
A Framework for Defining Logical Frameworks. Computation, Meaning, and Logic 2007: 399-436 - 2006
- [c27]Daniela Cancila, Furio Honsell, Marina Lenisa:
Some Properties and Some Problems on Set Functors. CMCS 2006: 67-84 - [c26]Daniela Cancila, Furio Honsell, Marina Lenisa:
Functors Determined by Values on Objects. MFPS 2006: 151-169 - 2005
- [j5]Samson Abramsky, Marina Lenisa:
Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Log. 134(2-3): 122-168 (2005) - [c25]Furio Honsell, Marina Lenisa, Rekha Redamalla:
Coalgebraic Description of Generalized Binary Methods. DCM@ICALP 2005: 73-84 - 2004
- [j4]Marina Lenisa, John Power, Hiroshi Watanabe:
Category theory for operational semantics. Theor. Comput. Sci. 327(1-2): 135-154 (2004) - [c24]Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan:
Modeling Fresh Names in the ?-calculus Using Abstractions. CMCS 2004: 25-41 - [e3]Furio Honsell, Marina Lenisa, Marino Miculan:
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, COMETA 2003, Udine, Italy, December 15-17, 2003. Electronic Notes in Theoretical Computer Science 104, Elsevier 2004 [contents] - 2003
- [c23]Furio Honsell, Marina Lenisa, Rekha Redamalla:
Strict Geometry of Interaction Graph Models. LPAR 2003: 407-421 - [c22]Furio Honsell, Marina Lenisa:
"Wave-Style" Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models. TYPES 2003: 242-258 - [c21]Furio Honsell, Marina Lenisa, Marino Miculan:
Preface. COMETA 2003: 1-3 - [c20]Daniela Cancila, Furio Honsell, Marina Lenisa:
Properties of Set Functors. COMETA 2003: 61-80 - [c19]Daniela Cancila, Furio Honsell, Marina Lenisa:
Generalized Coiteration Schemata. CMCS 2003: 76-93 - [c18]Furio Honsell, Marina Lenisa, Rekha Redamalla:
Coalgebraic Semantics and Observational Equivalences of an Imperative Class-based OO-Language. COMETA 2003: 163-180 - 2002
- [e2]Marina Lenisa, Marino Miculan:
Theory of Concurrency, Higher Order Languages and Types, TOSCA 2001, Udine, Italy, November 19-21, 2001. Electronic Notes in Theoretical Computer Science 62, Elsevier 2002 [contents] - 2001
- [c17]Samson Abramsky, Marina Lenisa:
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. CSL 2001: 443-457 - [c16]Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan:
Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic. TOSCA 2001: 136-156 - [c15]Marina Lenisa, Marino Miculan:
Preface. TOSCA 2001: 257-258 - [c14]Andrea Corradini, Marina Lenisa, Ugo Montanari:
Preface. CMCS 2001: 308-309 - [e1]Andrea Corradini, Marina Lenisa, Ugo Montanari:
Coalgebraic Methods in Computer Science, CMCS 2001, a Satellite Event of ETAPS 2001, Genova, Italy, April 6-7, 2001. Electronic Notes in Theoretical Computer Science 44(1), Elsevier 2001 [contents] - 2000
- [c13]Samson Abramsky, Marina Lenisa:
A Fully Complete PER Model for ML Polymorphic Types. CSL 2000: 140-155 - [c12]Samson Abramsky, Marina Lenisa:
Axiomatizing Fully Complete Models for ML Polymorphic Types. MFCS 2000: 141-151 - [c11]Furio Honsell, Marina Lenisa:
Coalgebraic Coinduction in (Hyper)set-theoretic Categories. CMCS 2000: 132-159 - [c10]Marina Lenisa, John Power, Hiroshi Watanabe:
Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. CMCS 2000: 230-260
1990 – 1999
- 1999
- [j3]Furio Honsell, Marina Lenisa:
Coinductive characterizations of applicative structures. Math. Struct. Comput. Sci. 9(4): 403-435 (1999) - [j2]Furio Honsell, Marina Lenisa:
Semantical Analysis of Perpetual Strategies in lambda-Calculus. Theor. Comput. Sci. 212(1-2): 183-209 (1999) - [c9]Marina Lenisa:
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects. FoSSaCS 1999: 243-257 - [c8]Marina Lenisa:
From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems. CMCS 1999: 2-22 - 1998
- [c7]Furio Honsell, Marina Lenisa, Ugo Montanari, Marco Pistore:
Final semantics for the pi-calculus. PROCOMET 1998: 225-243 - 1997
- [j1]Marco Forti, Furio Honsell, Marina Lenisa:
An Axiomatization of Partial n-Place Operations. Math. Struct. Comput. Sci. 7(3): 283-302 (1997) - [c6]Marina Lenisa:
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. TAPSOFT 1997: 309-320 - [c5]Marina Lenisa:
Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-calculi. TLCA 1997: 248-266 - 1996
- [c4]Marina Lenisa:
Final Semantics for a Higher Order Concurrent Language. CAAP 1996: 102-118 - 1995
- [c3]Furio Honsell, Marina Lenisa:
Final Semantics for untyped lambda-calculus. TLCA 1995: 249-265 - 1994
- [c2]Michael Forti, Furio Honsell, Marina Lenisa:
Processes and Hyperuniverses. MFCS 1994: 352-363 - 1993
- [c1]Furio Honsell, Marina Lenisa:
Some Results on the Full Abstraction Problem for Restricted Lambda Calculi. MFCS 1993: 84-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 02:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
