论文信息 - Executable Specification of Static Semantics

Executable Specification of Static Semantics

In this paper we have presented three main ideas: Semantic specifications written using inference rules may be executed. The method may be compared with the approach taken in the SIS system of Peter Mosses [Mos78]. A Prolog system is adequate for executing such a specification. Intensive use of overloading make semantic specifications easier and more elegant.

Thierry Despeyroux | T. Despeyroux

[1] Bernard Lang,et al. Metal: A Formalism to Specify Formalisms , 1983, Sci. Comput. Program..

[2] Lawrence Charles Paulson. A compiler generator for semantic grammars , 1981 .

[3] Ravi Sethi,et al. A semantic model of types for applicative languages , 1982, LFP '82.

[4] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.

[5] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[6] Thomas W. Reps,et al. Generating Language-Based Environments , 1982 .

[7] Vaughan R. Pratt,et al. Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[8] Vaughan R. Pratt,et al. SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[9] Bernard Lang,et al. Programming Environments Based on Structured Editors: The MENTOR Experience, , 1980 .

[10] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..