Author image not provided
 Fabio Alessi

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.73
Citation Count41
Publication count15
Publication years1994-2008
Available for download1
Average downloads per article300.00
Downloads (cumulative)300
Downloads (12 Months)9
Downloads (6 Weeks)1
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


15 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 15 of 15
Sort by:

1
May 2008 Theoretical Computer Science: Volume 398 Issue 1-3, May, 2008
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

In this paper we introduce a new filter model, which is of a kind that has escaped investigation up to now: it is induced by an intersection type theory generated in a non-standard way, by a preorder which puts into relation an atom with an arrow type, without equating them. ...
Keywords: Intersection types, Lambda calculus semantics, Lattices

2
January 2008 SOFSEM'08: Proceedings of the 34th conference on Current trends in theory and practice of computer science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Filter models and (solutions of) recursive domain equations are two different ways of constructing lambda models. Many partial results have been shown about the equivalence between these two constructions (in some specific cases). This paper deepens the connection by showing that the equivalence can be shown in a general framework. ...

3
April 2006 Theoretical Computer Science - Logic, language, information and computation: Volume 355 Issue 2, 11 April 2006
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 5

Invariance of interpretation by β-conversion is one of the minimal requirements for any standard model for the λ-calculus. With the intersection-type systems being a general framework for the study of semantic domains for the λ-calculus, the present paper provides a (syntactic) characterisation of the above mentioned requirement in terms of ...
Keywords: λcalculus, λ-models, β- and η-reduction/expansion, intersection types

4
July 2005 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 136, July, 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

We show how to use intersection types for building models of a @l-calculus enriched with recursive terms, whose intended meaning is of minimal fixed points. As a by-product we prove an interesting consistency result.
Keywords: intersection types, easy terms, fixed points, λ-models

5
May 2004 Theoretical Computer Science - Logic, semantics and theory of programming: Volume 316 Issue 1-3, 28 May 2004
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 7

We use intersection types as a tool for obtaining λ-models. Relying on the notion of easy intersection type theory, we successfully build a λ-model in which the interpretation of an arbitrary simple easy term is any filter which can be described by a continuous predicate. This allows us to prove ...
Keywords: models of lambda calculus, intersection types, fixed point operators, lambda calculus, lambda theories

6
January 2003 Theoretical Computer Science: Volume 290 Issue 1, 1 January 2003
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 2

In this paper we introduce SFP M , a category of SFP domains which provides very satisfactory domain-models, i.e. "partializations", of separable Stone spaces (2- Stone spaces ). More specifically, SFP M is a subcategory of SFP ep , closed under direct limits as well as many constructors, such as ...
Keywords: domain theory, stone spaces, denotational semantics, totality

7 published by ACM
January 2003 ACM Transactions on Computational Logic (TOCL): Volume 4 Issue 1, January 2003
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 300

Full text available: PDFPDF
We characterize those type preorders which yield complete intersection-type assignment systems for λ-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics, the simple semantics, and the F-semantics. These semantics arise by taking as interpretation of types subsets of applicative structures, as interpretation of the preorder ...
Keywords: completeness, intersection types, Lambda calculus, lambda models

8
October 2001 ICTCS '01: Proceedings of the 7th Italian Conference on Theoretical Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 7

We illustrate the use of intersection types as a tool for synthesizing �-models which exhibit special purpose features. We focus on semantical proofs of easiness. This allows us to prove that the class of �-theories induced by graph models is strictly included in the class of �-theories induced by non-extensional ...

9
February 1998 Theoretical Computer Science: Volume 193 Issue 1-2, Feb. 28, 1998
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0


10
December 1997 Fundamenta Informaticae: Volume 32 Issue 3,4, December 1997
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

To model at the same time parallel and nondeterministic functional calculi we define a powerdomain functor &Rgr; such that it is an endofunctor over the category of algebraic lattices. &Rgr; is locally continuous and we study the initial solution D ∞ of the domain equation D = &Rgr;([D → D] ...
Keywords: Full Abstraction, Nondeterminism, Powerdomain Construction, λ-calculus, Intersection Type Disciplines

11
December 1997 Fundamenta Informaticae: Volume 32 Issue 3-4, Dec. 1997
Publisher: IOS Press
Bibliometrics:
Citation Count: 1

Keywords: full abstraction, intersection type disciplines, powerdomain construction, λ-calculus, nondeterminism

12
April 1997 TAPSOFT '97: Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2


13
July 1995 Theoretical Computer Science: Volume 146 Issue 1-2, July 24, 1995
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 3


14
August 1994 MFCS '94: Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2


15
April 1994 CAAP '94: Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us