Mathematical Foundations of Programming Language Semantics: 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987 : ProceedingsMichael Main |
Contents
A Categorical Treatment of Polymorphic Operations | 2 |
A Categorical Approach to Realizability and Polymorphic Types | 23 |
RuleBased Semantics for an Extended LambdaCalculus | 43 |
Copyright | |
29 other sections not shown
Other editions - View all
Common terms and phrases
abstract action adjoint algebraic lattice algebraic types applied arrows assertional category axioms bialgebra bound called cartesian closed cartesian closed category category theory Cauchy sequence closure cocones compact elements compiler complete Computer Science cone construction constructor expressions continuous CPO continuous lattice coproduct corresponding countable CPO's declaration defined definition denotational semantics diagram domain equations EDHT-category embedding equivalence example exists finite fixed point function space functor given graph hence infinite initial algebra integers interpretation isomorphism Lawson topology Lemma logic mathematical metric space monoid morphism N-graded natural numbers natural transformations node nondeterministic notation object operations pair par-nd partial evaluation partial order Plotkin polymorphic poset power domain powerspace Pr(D Proc programming languages proof properties Proposition QMet quasi-uniformity quasimetric space refine relation result satisfies Scott topology semilattice sketch subcategory subset syntactic Theorem theory tree unique variables