| Gordon D. Plotkin. Types and partial functions. Lecture Notes, Computer Science Department, University of Edinburgh, 1985. |
....To obtain the type of an expression it would be possible to first translate it to higher order functions, as described in the previous section, and then find the type using traditional methods. However, it is also possible to obtain the type directly, using modified inference rules. Traditionally [Plotkin 81] type inference rules for expressions are written like this: 14 # # E 0 : bool # # E 1 : # # # E 2 : # # # if E 0 then E 1 else E 2 : # This reads: if E 0 is of type bool, and E 1 and E 2 of the same type # in the (type) environment #, then the type of the conditional expression in # ....
Gordon Plotkin: A Structural Approach to Operational Semantics. Technical Report FN19, Computer Science Department, Aarhus University, Aarhus, Denmark (September 1981).
.... in an otherwise classical predicate logic (perhaps with identity) as chronicled in the work of some of the eld s pioneers [18, 20] The relevance of free logic to some branches of mathematics and related areas of mathematical computer science was explicitly argued beginning in the 1960 s [29, 30, 24, 23]. As noted elsewhere [15] free logic has been implicit from the beginning in a central area of computer science, program speci cation and veri cation [17] The term free logic has not been current in the mathematics and computer science literature, however, because some authors object to the ....
Gordon D. Plotkin. Types and partial functions. Lecture Notes, Computer Science Department, University of Edinburgh, 1985.
No context found.
M. Gordon. Operational reasoning and denotational semantics. Technical Report STAN-CS-75506, Stanford University, Computer Science Department, August 1975.
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