M.J.Gordon, R.Milner, C.P.Wadsworth: Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science, n.78, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Uses of Higher Order Logic in Computational Linguistics Dale A. Miller and Gopalan Nadathur Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 3897 Abstract Consideration of the question of meaning in the framework of linguistics often requires an allusion to sets and other higher order notions. The traditional approach to representing and reasoning about meaning in a computa tional setting has been to use knowledge representation sysr ....

....a logic to provide a compositional semantics for simple English sentences. In the computational framework, knowledge representation systems are given the task of rep resenting the semantical notions that are needed in natural This work has been supported by NSF grants MCS 8219196 CER, MCS 82 07294, AI Center grants MCS 8305221, US Army Research Office grant ARO DAA29 849 0027, and DARPA N000 14 85 K 0018. language understanding programs. While the formal justifications that are provided for such systems is usually logical, the actual formalisms used are often distantly related to ....

[Article contains additional citation context not shown here]

Michael J. Gordon, Arthur J. Milner, Christopher P. Wadsworth, Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science No. 78, 1979.

....of type vat ( or Out: an automatic coercion is applied to obtain a value of type . a; The: sign is used as the assignment operator; it requires a destination of type war (A) and a source of type and returns ok after performing the side effect: 5 The problems encountered in ML [Gordon Milner Wadsworth 79, page 52] are avoided by the use of explicit polymorphism. However, we have to take some precautions with subtyping, as explained later. a: 5; a l; 6 : Int Functions cannot refer directly to global variables of Var type; these must be either passed as in and out parameters, or embedded ....

M.J.Gordon, R.Milner, C.P.Wadsworth: Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science, n.78, 1979.

....a binding or signature; it then receives a Var type. let var a=3; # let var a:Int = 3 The answer let var a:Int = 3 above should be read as meaning that a has type Var (Int) When evaluating an expression of type Var (A) or Out (A) an automatic coercion is 2 The problems encountered in ML [Gordon Milner Wadsworth 79, page 52] are avoided by the use of explicit polymorphism. However, we have to take some precautions with subtyping, as explained later. May 12, 1994 Page 30 applied to obtain a value of type A. a; # 3 : Int The : sign is used as the assignment operator; it requires a destination of type ....

M.J.Gordon, R.Milner, C.P.Wadsworth: Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science, n.78, 1979.

....the notation normally used in a first order language. Since the language is a typed one, types must be associated with each term. This is done by either explicitly defining the type of a constant or a variable, or by inferring such a type by a process very similar to that used in the language ML [7]. The type expressions that are attached to symbols may contain variables which provide a form of polymorphism. As an example cons and nil above are assumed to have the types A (list A) list A) and (list A) respectively; they serve to define lists of different kinds, but each list being ....

Michael J. Gordon, Arthur J. Milner, Christopher P. Wadsworth, Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science No. 78, 1979.

....Var(A) or Out(A) an automatic coercion is applied to obtain a value of type A. a; 3 : Int The : sign is used as the assignment operator; it requires a destination of type Var(A) and a source of type A, and returns ok after performing the side effect: 5 The problems encountered in ML [Gordon Milner Wadsworth 79, page 52] are avoided by the use of explicit polymorphism. However, we have to take some precautions with subtyping, as explained later. Page 27 . a: 5; ok : Ok . a 1; 6 : Int Functions cannot refer directly to global variables of Var type; these must be either passed as in and out ....

M.J.Gordon, R.Milner, C.P.Wadsworth: Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science, n.78, 1979.

....models for our semantics. To choose a standard finite Low Level Net model such as finite, safe, labelled, P T systems would restrict our modelling capabilities to excessively small sub classes of existing process algebras. The reason for this is that whereas, for instance, CCS is Turing powerful ([10]) finite, safe, labelled, P T systems are not, i.e. there exist reasonable computational systems expressible in CCS (such as a counter [12] which can not be expressed in terms of finite, safe, labelled P T system. There are, however, finite Low Level Net models, such as finite, non safe, ....

R. Milner: A Calculus of Communicating Systems. Springer Verlag Lecture Notes in Computer Science, Vol. 84 (1980).

No context found.

M.J.Gordon, R.Milner, C.P.Wadsworth: Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science, n.78, 1979.

No context found.

M. J. Gordon, A. J. Milner and C. P. Wadsworth, Edinburgh LCF, Springer-Verlag Lecture Notes in Computer Science, Vol. 78, Berlin, 1982.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC