Parameterized Horn Clause Specifications: Proof Theory and Correctness
暂无分享,去创建一个
[1] José Meseguer,et al. Equality, Types, Modules, and (Why not ?) Generics for Logic Programming , 1984, J. Log. Program..
[2] José Meseguer,et al. Universal Realization, Persistent Interconnection and Implementation of Abstract Modules , 1982, ICALP.
[3] M. Arbib,et al. Arrows, Structures, and Functors: The Categorical Imperative , 1975 .
[4] Joseph A. Goguen,et al. The Semantics of CLEAR, A Specification Language , 1979, Abstract Software Specifications.
[5] Fernando Orejas. Passing Compatibility is almost Persistency , 1984, ADT.
[6] John L. Bell,et al. Models and Ultraproducts: An Introduction. , 1969 .
[7] Hartmut Ehrig,et al. Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.
[8] Hans-Dieter Ehrich. On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types , 1982, JACM.
[9] James W. Thatcher,et al. Data Type Specification: Parameterization and the Power of Specification Techniques , 1982, TOPL.
[10] Peter Padawitz. Parameter Preserving Data Type Specifications , 1985, TAPSOFT, Vol.1.
[11] A. Selman. Completeness of calculii for axiomatically defined classes of algebras , 1972 .
[12] Hartmut Ehrig,et al. Algebraic Theory of Parameterized Specifications with Requirements , 1981, CAAP.
[13] Peter Padawitz,et al. Towards a Proof Theory of Parameterized Specifications , 1984, Semantics of Data Types.
[14] Harald Ganzinger,et al. Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability , 1983, TOPL.
[15] Hartmut Ehrig,et al. Parameter Passing in Algebraic Specification Languages , 1984, Theor. Comput. Sci..