4. TACS 2001:
: Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness.
: Termination Proofs and Complexity Certification.
: A Renee Equation for Algorithmic Complexity.
Andrew M. Pitts
: Nominal Logic: A First Order Theory of Names and Binding.
: A Logic Programming Language Based on Binding Algebras.
: Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders.
: Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems.
: Weakest Congruence Results Concerning "Any-Lock".
: Strong Normalization of Second Order Symmetric Lambda-mu Calculus.