Swinging types=functions+relations+transition systems
- 28 July 2000
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 243 (1-2) , 93-165
- https://doi.org/10.1016/s0304-3975(00)00171-7
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a CongruenceElectronic Notes in Theoretical Computer Science, 1999
- Algebraic Foundations of Systems SpecificationPublished by Springer Nature ,1999
- Specification of abstract dynamic-data types: A temporal logic approachTheoretical Computer Science, 1997
- Behavioural and abstractor specificationsScience of Computer Programming, 1995
- Proving the correctness of behavioural implementationsPublished by Springer Nature ,1995
- Logic of transition systemsJournal of Logic, Language and Information, 1994
- Algebraic specification of concurrencyLecture Notes in Computer Science, 1993
- Observational structures and their logicTheoretical Computer Science, 1992
- Parametrized data types do not need highly constrained parametersInformation and Control, 1982
- Partial abstract typesActa Informatica, 1982