Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

55

TACS
2001
Springer

favoriteEmaildiscussreport

99views Software Engineering» more TACS 2001»

Nominal Logic: A First Order Theory of Names and Binding

15 years 2 months ago

Nominal Logic: A First Order Theory of Names and Binding

Download www.cl.cam.ac.uk

Andrew M. Pitts

Real-time Traffic

Software Engineering | TACS 2001 |

claim paper

Related Content

» Toward a general theory of names binding and scope

» Permissivenominal logic

» Nominal rewriting systems

» A fresh look at programming with names and binders

» Pure Type Systems in Rewriting Logic Specifying Typed HigherOrder Languages in a FirstOrde...

» The Decidability of the FirstOrder Theory of KnuthBendix Order

» A New Foundation for Nominal Isabelle

» Generative unbinding of names

» A computational approach to reflective metareasoning about languages with bindings

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	TACS
Authors	Andrew M. Pitts

Comments (0)