Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Barthe, Gilles
1995.
Fundamentals of Computation Theory.
Vol. 965,
Issue. ,
p.
126.
Goguen, Joseph A.
and
Diaconescu, Răzvan
1995.
Algebraic Methodology and Software Technology.
Vol. 936,
Issue. ,
p.
91.
Diaconescu, Răzvan
1995.
Completeness of category-based equational deduction.
Mathematical Structures in Computer Science,
Vol. 5,
Issue. 1,
p.
9.
Diaconescu, Răzvan
1996.
Category-based modularisation for equational logic programming.
Acta Informatica,
Vol. 33,
Issue. 5,
p.
477.
Steggles, L. J.
1996.
Higher-Order Algebra, Logic, and Term Rewriting.
Vol. 1074,
Issue. ,
p.
238.
Diaconescu, Răzvan
1996.
Recent Trends in Data Type Specification.
Vol. 1130,
Issue. ,
p.
200.
Haxthausen, Anne Elisabeth
and
Nickl, Friederike
1996.
Algebraic Methodology and Software Technology.
Vol. 1101,
Issue. ,
p.
132.
Cerioli, Maura
Haxthausen, Anne
Krieg-Brückner, Bernd
and
Mossakowski, Till
1997.
Algebraic Methodology and Software Technology.
Vol. 1349,
Issue. ,
p.
91.
Janssen, Theo M.V.
and
Partee, Barbara H.
1997.
Handbook of Logic and Language.
p.
417.
Futatsugi, K.
and
Nakagawa, A.
1997.
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks.
p.
170.
Diaconescu, Răzvan
Futatsugi, Kokichi
Ishisone, Makoto
Nakagawa, Ataru T.
and
Sawada, Toshimi
1998.
An Overview of CafeOBJ.
Electronic Notes in Theoretical Computer Science,
Vol. 15,
Issue. ,
p.
285.
Goguen, Joseph
Malcolm, Grant
and
Kemp, Tom
1998.
Principles of Declarative Programming.
Vol. 1490,
Issue. ,
p.
445.
Barthe, Gilles
and
Frade, Maria João
1999.
Programming Languages and Systems.
Vol. 1576,
Issue. ,
p.
109.
Gibson, Paul
Hamilton, Geoff
and
Méry, Dominique
1999.
IFM’99.
p.
129.
Diaconescu, R.ăzvan
Futatsugi, Kokichi
and
Iida, Shusaku
1999.
FM’99 — Formal Methods.
Vol. 1709,
Issue. ,
p.
1644.
Barthe, Gilles
1999.
Order-Sorted Inductive Types.
Information and Computation,
Vol. 149,
Issue. 1,
p.
42.
Padawitz, Peter
2000.
Swinging types=functions+relations+transition systems.
Theoretical Computer Science,
Vol. 243,
Issue. 1-2,
p.
93.
Diaconescu, Rzvan
Futatsugi, Kokichi
and
Iida, Shusaku
2000.
CAFE: An Industrial-Strength Algebraic Formal Method.
p.
33.
Goguen, Joseph
and
Malcolm, Grant
2000.
A hidden agenda.
Theoretical Computer Science,
Vol. 245,
Issue. 1,
p.
55.
Goguen, Joseph A.
Winkler, Timothy
Meseguer, José
Futatsugi, Kokichi
and
Jouannaud, Jean-Pierre
2000.
Software Engineering with OBJ.
Vol. 2,
Issue. ,
p.
3.