A type theoretic framework for formal metamodelling

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

Volumn 3938 LNCS, Issue , 2006, Pages 262-298

  Poernomo, Iman ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; METADATA; THEOREM PROVING;

METAMODELLING APPROACH; MODEL DRIVEN ARCHITECTURE; OBJECT MANAGMENT;

SOFTWARE ENGINEERING;

EID: 33746049175     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786160_15     Document Type: Conference Paper

References (25)

1. M. Abadi and L. Cardelli. A Theory of Objects. Monographs in Computer Science. Springer, 1996.
2. David H. Akehurst, Stuart Kent, and Octavian Patrascoiu. A relational approach to defining and implementing transformations between metamodels. Software and System Modeling, 2(4):215-239, 2003.
3. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993.
4. Ulrich Berger and Helmut Schwichtenberg. Program development by proof transformation. In Helmut Schwichtenberg, editor, Proceedings of the NATO Advanced Study Institute on Proof and Computation, pages 1-45, 1993.
5. Mark Bickford, Robert Constable, Joseph Halpern, and Sabina Petride. Knowledge-based synthesis of distributed systems using event structures. In Logic for Programming, Artificial Intelligence and Reasoning: 11th International Conference, LPAR 2004, volume 3452 of Lecture Notes in Computer Science LNCS, pages 449-465. Springer-Verlag, 2005.
6. CoFI Language Design Task Group on Language Design. CASL, The Common Algebraic Specification Language (version 1.0.1), Summary, 25 March 2001, March 2001.
7. Robert Constable, N. Mendier, and D. Howe. Implementing Mathematics with the Nuprl Proof Development System. Englewood Cliffs, NJ: Prentice-Hall, 1986.
8. Therry Coquand. Metamathematical Investigations of a Calculus of Constructions. In Logic and Computer Science, pages 91 - 122, 1990.
9. Thierry Coquand. Infinite objects in type theory. In H. Barendregt and T. Nipkow, editors, The First International Workshop on Types for Proofs and Programs, TYPES'93, Nijmegen, The Netherlands, 24-28 May 1993, Selected papers, volume 806 of LNCS, pages 62-78. Springer, 1994.
10. Haskell Curry. Functionality in combinatory logic. In Proceedings of the National Academy of Science of the USA, volume 20, pages 154-180, 1934.
11. Liliana Favre. Foundations for mda-based forward engineering. Journal of Object Technology, 4(1):129-153, January-February 2005.
12. Joseph Goguen, Timothy Winkler, Jose Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ3. In Software Engineering with OBJ: Algebraic Specification in Action. Kluwer Academic Publishers, 2000.
13. Susumu Hayashi and Hiroshi Nakano. PX, a Computational Logic. Foundations of Computing. MIT Press, 1988. Electronic edition available at http://www.shayashi.jp/PXbook.html (Accessed May 2003).
14. William A. Howard. The formulae-as-types notion of construction. In To H. B. Curry : Essays on Combinatory logic, Lambda calculus, and Formalism, pages 479-490. Academic Press, London, New York, 1980.
15. Marieke Huisman and Bart Jacobs. Java program verification via a hoare logic with abrupt termination. In Fundamental Approaches to Software Engineering, FASE 2000, volume 1783 of Lecture Notes in Computer Science LNCS, pages 284-303. Springer-Verlag, 2000.
16. Zhaohui Luo. Program specification and data refinement in type theory. Mathematical Structures in Computer Science, 3(3), 1993.
17. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984.
18. Jishnu Mukerji and Joaquin Miller. MDA Guide Version 1.0.1. Object Management Group, 2003.
19. OMG. Meta Object Facility (MOF) Specification. Object Management Group, 000.
20. Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architecture: Prolegomena to the design of pvs. IEEE Transactions on Software Engineering, 21(2):107-125, 1995.
21. Christine Paulin-Mohring and Benjamin Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation, 15(5/6):607-640, 1993.
22. Iman Poernomo, John Crossley, and Martin Wirsing. Adapting Proofs-as-Programs: The Curry-Howard Protocol. Monographs in computer science. Springer, 2005.
23. Erik Poll. Subtyping and Inheritance for Categorical Datatypes. In Theories of Types and Proofs (TTP) - Kyoto, RIMS Lecture Notes 1023, pages 112-125. Kyoto University Research Insitute for Mathematical Sciences, 1998.
24. Anthony J.H. Simons. The theory of classification, part 3: Object encodings and recursion. Journal of Object Technology, 14):49-57, September-October 2002.
25. Coupet-Grimal Solange and Jakubiec Line. Coq and hardware verification: A case study. In International Conference on Theorem Proving in Higher Order Logics, TPHOLs'96, volume 1125 of Lecture Notes in Computer Science LNCS, pages 26-30. Springer-Verlag, 1996.