Definition and basic properties of the deva meta-calculus

@article{Weber1993DefinitionAB,
  title={Definition and basic properties of the deva meta-calculus},
  author={Matthias Weber},
  journal={Formal Aspects of Computing},
  year={1993},
  volume={5},
  pages={391-431}
}
This article presents the definition and some basic properties of the Deva meta-calculus, a generic logical framework whose design was driven by the needs arising from the instantiation to software development methods. As a result, Deva contains structures that do not occur in comparable logical frameworks. There now exist a number of case studies about the formalization of software development methods in Deva. In this article, a structured definition of Deva is presented and basic parts of its… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Deriving Transivity of VDM-Reification in DEVA

Formalization of the Bird-Meertens Algorithmic Calculus in the Deva MetaCalculus

  • author's adress, M. 1989. Weber
  • Programming Concepts and Methods,
  • 1990

ed.), ESPRIT Project ToolUse, Final Report of the Deva Support Task: Retrospective and Manuals

  • R. Gabriel
  • Arbeitspapiere der GMD,
  • 1990

Introduction to Combinators and 2-Calculus

  • J. R. Hindley, Seldin, J.E
  • Defining Logics. Proceedings of the 2nd Symposium on Logic in Computer Science,
  • 1986

Constructions: A Higher Order Proof System for Mechanizing Mathematics