Fabio Alessi

According to our database1, Fabio Alessi authored at least 25 papers between 1991 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
LF+ in Coq for "fast and loose" reasoning.
J. Formaliz. Reason., 2019

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning.
Proceedings of the Fourteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2019

2016
Tiered Objects.
Fundam. Informaticae, 2016

2008
An irregularfilter model.
Theor. Comput. Sci., 2008

Recursive Domain Equations of Filter Models.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2006
Intersection types and lambda models.
Theor. Comput. Sci., 2006

2004
Intersection types and domain operators.
Theor. Comput. Sci., 2004

Type Preorders and Recursive Terms.
Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

2003
A complete characterization of complete intersection-type preorders.
ACM Trans. Comput. Log., 2003

A category of compositional domain-models for separable Stone spaces.
Theor. Comput. Sci., 2003

Intersection Types and Computational Rules.
Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003

Tailoring Filter Models.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2002
Simple Easy Terms.
Proceedings of the Intersection Types and Related Systems, 2002

2001
Filter Models and Easy Terms.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
A Complete Characterization of the Complete Intersection-Type Theories.
Proceedings of the ICALP Workshops 2000, 2000

1998
A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space.
Theor. Comput. Sci., 1998

1997
A Convex Powerdomain over Lattices: Its Logic and lambda-Calculus.
Fundam. Informaticae, 1997

Partializing Stone Spaces using SFP Domains (Extended Abstract).
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995
A Fixed-Point Theorem in a Category of Compact Metric Spaces.
Theor. Comput. Sci., 1995

Solutions of functorial and non-functorial metric domain equations.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

1994
Toward A Semantics for the Quest Language.
RAIRO Theor. Informatics Appl., 1994

May and Must Convergencey in Concurrent Lambda-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Type Preorders.
Proceedings of the Trees in Algebra and Programming, 1994

1991
Strong Conjunction and Intersection Types.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Towards a Semantics for the QUEST Language
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991


  Loading...