Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
Global Development via Local Observational Construction Steps
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Observational interpretation of casl specifications
Mathematical Structures in Computer Science
Externalized and internalized notions of behavioral refinement
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 5.23 |
General sentences that fit all contexts are not too many. In this paper the constraint of generality is investigated for constructions between behavioral specifications. Constructions informally represent algorithms, and the goal is to prove that generic constructions are definable. In the end we draw a parallel between this work and the ''theorems for free'' for parametric functions in System F by showing how one can derive properties of generic constructions solely from their generality.