• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Formalising a model of the lambda−calculus in HOL−st (1994)

by S Agerholm
Add To MetaCart

Tools

Sorted by:
Results 1 - 3 of 3

Some domain theory and denotational semantics in Coq

by Nick Benton, Andrew Kennedy, Carsten Varming , 2009
"... Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-variance recursive domain equations, and the existence of invariant relations on those solutions. We then define operatio ..."
Abstract - Cited by 9 (4 self) - Add to MetaCart
Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-variance recursive domain equations, and the existence of invariant relations on those solutions. We then define operational and denotational semantics for both a simplytyped CBV language with recursion and an untyped CBV language, and establish soundness and adequacy results in each case. 1

Mathematical Journals as Reasoning Agents: Literature Review

by Florina Piroi, et al.
"... ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract not found

Mathematical Journals as Reasoning Agents: Literature Review Contents

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University