Subsorted partial higher-order logic as an extension of CASL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1827, Issue , 2000, Pages 126-145

  Mossakowski, Till ^b   Haxthausen, Anne ^a   Krieg Brückner, Bernd ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; FORMAL LOGIC; SPECIFICATION LANGUAGES;

FIRST ORDER; FIRST ORDER LOGIC; HIGHER ORDER FUNCTIONS; HIGHER ORDER LOGIC; HIGHER-ORDER; PARTIAL LOGIC; PROOF CALCULUS;

COMPUTER CIRCUITS;

EID: 84947203298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44616-3_8     Document Type: Conference Paper

References (35)

1. J. Adámek, H. Herrlich, and G. Strecker. Abstract and Concrete Categories. Wiley, New York, 1990.
2. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic press, 1986.
3. E. Astesiano and M. Cerioli. On the existence of initial models for partial (higherorder) conditional specifications. In Proc. Joint Conf. on Theory and Practice of Software Development, pages 74–88. Springer LNCS 351, 1989.
4. Egidio Astesiano and Maura Cerioli. Partial Higher–Order Specifications. Fundamenta Informaticae, 16:101–126, 1992.
5. H. P. Barendregt. The Lambda Calculus. Number 103 in Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, revised edition, 1991.
6. H. P. Barendregt. Lambda calculi with types. In D. M. Gabbai Samson Abramski and T. S. E. Maiboum, editors, Handbook of Logic in Computer Science. Oxford University Press, Oxford, 1992.
7. T. Borzyszkowski. Moving specification structures between logical systems. Presented at the WADT 98 workshop, Lisbon, 1998.
8. Manfred Broy, Christian Facchi, Radu Grosu, Rudi Hettler, Heinrich Hussmann, Dieter Nazareth, Franz Regensburger, and Ketil Stolen. The requirement and design specification language Spectrum, an informal introduction, version 1.0. Technical report, Institut für Informatik, Technische Universit¨at München, March 1993.
9. P. Burmeister. A model theoretic approach to partial algebras. Akademie Verlag, Berlin, 1986.
10. M. Cerioli and J. Meseguer. May I borrow your logic? (transporting logical structures along maps). Theoretical Computer Science, 173:311–347, 1997.
11. M. Cerioli, T. Mossakowski, and H. Reichel. From total equational to partial first order logic. In E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner, editors, Algebraic Foundations of Systems Specifications, pages 31–104. Springer Verlag, 1999.
12. Maura Cerioli, Anne Haxthausen, Bernd Krieg-Brückner, and Till Mossakowski. Permissive subsorted partial logic in Casl. In Michael Johnson, editor, Algebraic methodology and software technology: 6th international conference, AMAST 97, volume 1349 of Lecture Notes in Computer Science, pages 91–107. Springer-Verlag, 1997.
13. W. A. Farmer. A partial functions version of Church’s simple type theory. Journal of Symbolic Logic, 55:1269–1291, 1991.
14. J. A. Goguen and R. M. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39:95–146, 1992. Predecessor in: LNCS 164, 221–256, 1984.
15. A. E. Haxthausen. Order-sorted algebraic specifications with higher-order functions. Theoretical Computer Science, 183:157–185, 1997.
16. K. Hoffmann, H. Ehrig, and U. Wolter. Folding and unfolding construction between algebraic high level nets and contextual higher order nets. Presented at WADT’99, 1999.
17. Furio Honsell and Donald Sannella. Pre-logical relations. In Proc. Computer Science Logic, CSL’99, volume 1683 of Lecture Notes in Computer Science, pages 546–561. Springer, 1999.
18. M. Kerber. Sound and complete translations from sorted higher-order logic into sorted first-order logic. In B. W. Wah M. Georgeff, Z. Shi, editor, Proceedings of PRICAI-94, Third Pacific Rim International Conference on Artificial Intelligence, pages 149–154, Beijing, China, August 1994. International Academic Publishers, Beijing, China.
19. M. Kohlhase. Higher-order automated theorem proving. Unpublished draft, Universit ¨at Saarbücken, 1999.
20. B. Krieg-Brückner and D. Sannella. Structuring Specifications in-the-large and in-the-small: Higher-Order Functions, Dependent Types and Inheritance in SPECTRAL. In S. Abramsky and T. S. E. Maibaum, editors, TAPSOFT’91. Proccedings of the International Joint Conference on Theory and Practice of Software Development. Volume 1: Colloquium on Trees in Algebra and Programming, pages 103–120. Springer LNCS 493, 1991.
21. CoFI Task Group on Language Design. Casl – The CoFI Algebraic Specification Language – Summary, version 1.0. Available at WWW10, October 1998.
22. Narciso Martí-Oliet and José Meseguer. Inclusions and subtypes I: First-order case. Journal of Logic and Computation, 6(3):409–438, June 1996.
23. K. Meinke. Universal algebra in higher types. Theoretical Computer Science, 100(2):385–417, June 1992.
24. J. Meseguer. General logics. In Logic Colloquium 87, pages 275–329. North Holland, 1989.
25. T. Mossakowski, Kolyang, and B. Krieg-Brückner. Static semantic analysis and theorem proving for CASL. In F. Parisi Presicce, editor, Recent trends in algebraic development techniques. Proc. 12th International Workshop, volume 1376 of Lecture Notes in Computer Science, pages 333–348. Springer, 1998.
26. Till Mossakowski, Anne Haxthausen, and Bernd Krieg-Brückner. Subsorted partial higher-order logic as an extension of casl. CoFI Note: L-10. Available at WWW11, October 1998.
27. Peter D. Mosses. CoFI: The Common Framework Initiative for Algebraic Specification and Development. In TAPSOFT’97: Theory and Practice of Software Development, volume 1214 of LNCS, pages 115–137. Springer-Verlag, 1997.
28. Axel Poigné. On specifications, theories, and models with higher types. Information and Control, 68(1–3):1–46, January/February/March 1986.
29. Z. Qian. An algebraic semantics of higher-order types with subtypes. Acta Informatica, 30(6):569–607, 1993.
30. D. T. Sannella and R. M. Burstall. Structured theories in LCF. In G. Ausiello and M. Protasi, editors, Proceedings of the 8th Colloquium on Trees in Algebra and Programming (CAAP’83), volume 159 of LNCS, pages 377–391, L’Aquila, Italy, March 1983. Springer.
31. P. Y. Schobbens. Second-order proof systems for algebraic specification languages. In H. Ehrig and F. Orejas, editors, Recent Trends in Data Type Specification, volume 785 of Lecture Notes in Computer Science, pages 321–336, 1994.
32. CoFI Task Group on Semantics. Casl – The CoFI Algebraic Specification Language (version 1.0) – Semantics. Version 0.95. CoFI Note: S-9. Available at WWW12, March 1999.
33. A. Tarlecki. Moving between logical systems. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specifications. 11th Workshop on Specification of Abstract Data Types, volume 1130 of Lecture Notes in Computer Science, pages 478–502. Springer Verlag, 1996.
34. A. Tarlecki. Towards heterogeneous specifications. In D. Gabbay and M. van Rijke, editors, Frontiers of Combining Systems, 2nd International Workshop. Kluwer, 1998. To appear.
35. A. Tarlecki, B. Möller, and M. Wirsing. Algebraic specifications of reachable higherorder algebras. In D. Sannella; A. Tarlecki, editor, Proceedings of the 5th Workshop on Recent Trends in Data Type Specification, volume 332 of LNCS, pages 154–169, Berlin, September 1988. Springer.