Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fundamenta Informaticae 30 (1997) 23--41 1 A Convex Powerdomain over Lattices: its Logic and
 

Summary: Fundamenta Informaticae 30 (1997) 23--41 1
IOS Press
A Convex Powerdomain over Lattices: its Logic and
–­Calculus
Fabio Alessi
Dipartimento di Matematica e Informatica
Universit`a di Udine
via delle Scienze 208, 33100 ­ Udine, ITALY
email: alessi@dimi.uniud.it
Mariangiola Dezani­Ciancaglini, Ugo de' Liguoro
Dipartimento di Informatica
Universit`a di Torino
corso Svizzera 185, 10149 ­ Torino, ITALY
email:dezani,deligu@di.unito.it
Abstract. To model at the same time parallel and non­deterministic functional calculi
we define a powerdomain functor P such that it is an endofunctor over the category
of algebraic lattices. P is locally continuous and we study the initial solution D 1 of
the domain equation D = P([D ! D]? ). We derive from the algebras of P the logic
of D 1 , that is the axiomatic description of its compact elements. We then define a
–­calculus and a type assignment system using the logic of D 1 as the related type

  

Source: Alessi, Fabio - Dipartimento di Matematica e Informatica, Università degli Studi di Udine
Torino, Università di - Dipartimento di Informatica

 

Collections: Computer Technologies and Information Sciences