Relating CASL with other specification languages: The institution level

Theoretical Computer Science

Volumn 286, Issue 2, 2002, Pages 367-475

  Mossakowski, Till ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Institutions; Logics; Specification languages; Translations of logics

Indexed keywords

FORMAL LOGIC; LOGIC PROGRAMMING; PROBLEM SOLVING; SEMANTICS; SOFTWARE PROTOTYPING; SYNTACTICS; THEOREM PROVING;

COMMON ALGEBRAIC SPECIFICATION LANGUAGES (CASL);

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 0037125846     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00369-3     Document Type: Conference Paper

References (78)

1. Extending CASL by late binding
2. CASL: The common algebraic specification language
3. Free objects and equational deduction for partial conditional specifications
4. Models of Horn theories
5. Axioms for abstract model theory
6. State-based extension of CASL
7. Module algebra
8. Logical systems for structured specifications
9. Partial algebras - Survey of a unifying approach towards a two-valued model theory for partial algebras
10. Pushout complements for partly total algebras
11. Permissive subsorted partial logic in CASL
12. May I borrow your logic? (transporting logical structures along maps)
13. From total equational to partial first order logic
14. Extra theory morphisms for institutions: Logical semantics for multi-paradigm languages
15. Algebraic specifications with generating constraints
16. Stretching first order equational logic: Proofs about partiality using subsorts and retracts
17. Institutions: Abstract model theory for specification and programming
18. Operational semantics of order-sorted algebra
19. Eqlog: Equality, types, and generic modules for logic programming
20. Remarks on many-sorted equational logic
21. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
22. An initial algebra approach to the specification, correctness and implementation of abstract data types
23. Report on the Larch shared language
24. Pushouts of order-sorted algebraic specifications
25. Equivalence and difference of institutions: Simulating horn clause logic with based algebras
26. Equational type logic
27. Conditional rewriting as a unified model of concurrency
28. Membership algebra as a logical framework for equational specification
29. Order-sorted algebra solves the constructor, selector, multiple representation and coercion problems
30. A hierarchy of institutions separated by properties of parameterized abstract data types
31. Equivalences among various logical frameworks of partial algebras
32. Using limits of parchments to systematically construct institutions of partial algebras
33. Colimits of order-sorted specifications
34. CASL: From semantics to tools
35. Specification in an arbitrary institution with symbols
36. Subsorted partial higher-order logic as an extension of CASL
37. Static semantic analysis and theorem proving for CASL
38. Combining and representing logical systems using model-theoretic parchments
39. Unified algebras and institutions
40. CASL for ASF+SDF users, in ASF+SDF '97
41. CoFI: The common framework initiative for algebraic specification and development
42. CASL for CafeOBJ users
43. CASL-CHART: A combination of statecharts and of the algebraic specification language CASL
44. Specifications in an arbitrary institution
45. On the existence of free models in abstract algebraic institutions
46. Moving between logical systems