Typed Abstract State Machines
暂无分享,去创建一个
Yuri Gurevich | Karl Stroetmann | Giuseppe Del Castillo | Y. Gurevich | K. Stroetmann | G. D. Castillo
[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[2] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..
[3] K. Fernow. New York , 1896, American Potato Journal.
[4] Fergus Henderson,et al. Determinism analysis in the Mercury compiler , 1996 .
[5] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[6] John C. Mitchell,et al. Foundations for programming languages , 1996, Foundation of computing series.
[7] I. G. BONNER CLAPPISON. Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.
[8] Philip Wadler,et al. How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.
[9] Christoph Beierle,et al. Logic Programming: Formal Methods and Practical Applications , 1994 .
[10] Christoph Beierle. Type Inferencing for Polymorphic Order-Sorted Logic Programs , 1995, ICLP.
[11] Nissim Francez,et al. Basic simple type theory , 1998 .
[12] James H. Morris,et al. Lambda-calculus models of programming languages. , 1969 .
[13] Christoph Beierle. Concepts, Implementation, and Applications of a Typed Logic Programming Language , 1995, Logic Programming: Formal Methods and Practical Applications.
[14] Dan Suciu,et al. Journal of the ACM , 2006 .
[15] R. Lathe. Phd by thesis , 1988, Nature.
[16] Yuri Gurevich. May 1997 Draft of the ASM Guide , 2017 .
[17] Yuri Gurevich,et al. Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.
[18] Ryan Stansifer,et al. Type inference with subtypes , 1988, POPL '88.
[19] Karl Stroetmann. The Constrained Shortest Path Problem: A Case Study in Using ASMs , 1997, J. Univers. Comput. Sci..