default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabio Alessi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j11]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)- [c14]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 - 2016
- [j10]Fabio Alessi, Felice Cardone:
Tiered Objects. Fundam. Informaticae 149(3): 263-295 (2016)
2000 – 2009
- 2008
- [j9]Fabio Alessi:
An irregularfilter model. Theor. Comput. Sci. 398(1-3): 129-149 (2008) - [c13]Fabio Alessi, Paula Severi:
Recursive Domain Equations of Filter Models. SOFSEM 2008: 124-135 - 2006
- [j8]Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini:
Intersection types and lambda models. Theor. Comput. Sci. 355(2): 108-126 (2006) - 2004
- [j7]Fabio Alessi, Mariangiola Dezani-Ciancaglini, Stefania Lusin:
Intersection types and domain operators. Theor. Comput. Sci. 316(1): 25-47 (2004) - [c12]Fabio Alessi, Mariangiola Dezani-Ciancaglini:
Type Preorders and Recursive Terms. ITRS 2004: 3-21 - 2003
- [j6]Fabio Alessi, Paolo Baldan, Furio Honsell:
A category of compositional domain-models for separable Stone spaces. Theor. Comput. Sci. 290(1): 599-635 (2003) - [j5]Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi:
A complete characterization of complete intersection-type preorders. ACM Trans. Comput. Log. 4(1): 120-147 (2003) - [c11]Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini:
Tailoring Filter Models. TYPES 2003: 17-33 - [c10]Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini:
Intersection Types and Computational Rules. WoLLIC 2003: 45-59 - 2002
- [c9]Fabio Alessi, Stefania Lusin:
Simple Easy Terms. ITRS 2002: 1-18 - 2001
- [c8]Fabio Alessi, Mariangiola Dezani-Ciancaglini, Furio Honsell:
Filter Models and Easy Terms. ICTCS 2001: 17-37 - 2000
- [c7]Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi:
A Complete Characterization of the Complete Intersection-Type Theories. ICALP Satellite Workshops 2000: 287-302 - [i1]Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi:
A Complete Characterization of Complete Intersection-Type Theories. CoRR cs.LO/0011039 (2000)
1990 – 1999
- 1998
- [j4]Fabio Alessi, Paolo Baldan:
A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space. Theor. Comput. Sci. 193(1-2): 113-127 (1998) - 1997
- [j3]Fabio Alessi, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro:
A Convex Powerdomain over Lattices: Its Logic and lambda-Calculus. Fundam. Informaticae 32(3-4): 193-250 (1997) - [c6]Fabio Alessi, Paolo Baldan, Furio Honsell:
Partializing Stone Spaces using SFP Domains (Extended Abstract). TAPSOFT 1997: 478-489 - 1995
- [j2]Fabio Alessi, Paolo Baldan, Gianna Bellè:
A Fixed-Point Theorem in a Category of Compact Metric Spaces. Theor. Comput. Sci. 146(1&2): 311-320 (1995) - [c5]Fabio Alessi, Paolo Baldan, Gianna Bellè, Jan J. M. M. Rutten:
Solutions of functorial and non-functorial metric domain equations. MFPS 1995: 1-12 - 1994
- [j1]Fabio Alessi, Franco Barbanera:
Toward A Semantics for the Quest Language. RAIRO Theor. Informatics Appl. 28(6): 513-555 (1994) - [c4]Fabio Alessi:
Type Preorders. CAAP 1994: 37-51 - [c3]Fabio Alessi, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro:
May and Must Convergencey in Concurrent Lambda-Calculus. MFCS 1994: 211-220 - 1991
- [c2]Fabio Alessi, Franco Barbanera:
Towards a Semantics for the QUEST Language. LICS 1991: 12-21 - [c1]Fabio Alessi, Franco Barbanera:
Strong Conjunction and Intersection Types. MFCS 1991: 64-73
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-04-24 23:12 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:
