Completeness for typed lazy inequalities. The Semantics of Second-Order Lambda Calculus. Continuations May be Unreasonable. Towards Fully Abstract Semantics for Local Variables. Bisimulation Can't Be Traced.
Computable Values Can Be Classical.
Empty Types in Polymorphic Lambda Calculus. Equations Between Regular Terms and an Application to Process Logic. SIAM J. Comput. The View of a Recent Convert to Denotational Semantics. Axiomatic Definability and Completeness for Recursive Programs.