| Tartalom: |
https://pp.bme.hu/ee/article/view/4542 |
| Archívum: |
PP Electrical Engineering |
| Gyűjtemény: |
Articles
|
| Cím: |
A BMF FOR SEMANTICS
|
| Létrehozó: |
Meijer, Erik
|
| Kiadó: |
Periodica Polytechnica Electrical Engineering
|
| Dátum: |
1991-01-01
|
| Tartalmi leírás: |
We show how the Bird-Meertens formalism (BMF) can be based on continuous algebras
such that finite and infinite datatypes may peacefully coexist. Until recently the theory
could only deal with either finite datatypes (= initial algebra) or infinite datatypes (=
final co-algebra). In the context of continuous algebras the initial algebra coincides with
the final co-algebra. Elements of this algebra can be finite, infinite or partial. We intend
to use EBMF for semantics directed compiler generation by combining initial algebra
semantics with the calculational power of BMF.
|
| Nyelv: |
angol
|
| Típus: |
info:eu-repo/semantics/article
Peer-reviewed Article
info:eu-repo/semantics/publishedVersion
|
| Formátum: |
application/pdf
|
| Azonosító: |
N/A
|
| Forrás: |
Periodica Polytechnica Electrical Engineering; Vol. 35, No. 3 (1991); 165-192
|
| Kapcsolat: |
|
