Paper Info
Title
Generic constructions for behavioral specifications
Abstract
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.
Year
DOI
Venue
2012
10.1016/j.tcs.2011.10.025
Theor. Comput. Sci.
Keywords
DocType
Volume
behavioral specification,System F,generic construction,general sentence,parametric function
Journal
415,
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
7
1
Name
Order
Citations
PageRank
Marius Petria1182.04