Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: categorical model

Sortuj według:

Ogranicz wyniki do:

A relation between unambiguous regular expressions and abstract data types

Preoteasa V.

Fundamenta Informaticae

1999

Vol. 40, Nr 1

53-77

Using a categorical model of abstract data types [2,3,13,15], we show, following the Kozen's technique [10] and Tarjan's constructions for a deterministic automaton [16], that if two unambiguous regular expressions define the same regular language, then they represent two isomorphic abstract data types.

A simple adequate categorical model for PCF, II

Braüner T.

Fundamenta Informaticae

1998

Vol. 33, nr 4

339-368

Usually types of PCF are interpreted as cpos and terms as continuous functions. It is then the case that non-termination of a closed term nation of a closed term of ground type corresponds to the interpretation being bottom; we say that the semantics is adequate. We shall here present an axiomatic approach to adequacy for PCF in the sense that we will introduce categorical axioms enabling an adequate semantics to be given. We assume the presence of certain 'undefined' maps with the role of being the interpretation of non-terminating terms, but the order-structure is left out. This is different from previous approaches where some kind of order-theoretic structure has been considered as part an adequate categorical model for PCF. We take the point of view that partiality is the fundamental notion from which order-structure should be derived, which is corroborated by the observation that our categorical model induces an order-theoretic model PCF in a canonical way.