A functional approach to syntax and typing
暂无分享,去创建一个
[1] M. Massink. Functional techniques in concurrency , 1996 .
[2] Marc A. de Kruijf. Compiler Construction , 1996, Lecture Notes in Computer Science.
[3] Nancy A. Lynch,et al. Hybrid I/O automata , 1995, Inf. Comput..
[4] Giuseppe Castagna,et al. Covariance and contravariance: conflict without a cause , 1995, TOPL.
[5] Raymond Boute. A declarative formalism supporting hardware/software codesign , 1995 .
[6] Jan A. Bergstra,et al. A propositional logic with 4 values: true, false, divergent and meaningless , 1995, J. Appl. Non Class. Logics.
[7] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[8] M. Seutter,et al. The development of semantic functions for a system description language with multiple interpretations , 1994 .
[9] S. V. Bakel,et al. Intersection type disciplines in Lambda Calculus and applicative term rewriting systems , 1993 .
[10] Paul B. Jackson. Nuprl and Its Use in Circuit Design , 1992, TPCD.
[11] W. Gareth J. Howells,et al. Implementation of the Veritas Design Logic , 1992, TPCD.
[12] Giuseppe Castagna,et al. A calculus for overloaded functions with subtyping , 1992, LFP '92.
[13] Zohar Manna,et al. From Timed to Hybrid Systems , 1991, REX Workshop.
[14] J. Michael Spivey,et al. The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.
[15] Raymond T. Boute,et al. System Semantics and formal circuit description , 1986 .
[16] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.
[17] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[18] Mariangiola Dezani-Ciancaglini,et al. A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.
[19] Alonzo Church,et al. Set Theory with a Universal Set , 1974 .
[20] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[21] Stephen Cole Kleene,et al. On notation for ordinal numbers , 1938, Journal of Symbolic Logic.