![Mathematics / Logic / Computer programming / Automated theorem proving / Logic programming / Mathematical logic / Term / Substitution / Principia Mathematica / Free variables and bound variables / Monad Mathematics / Logic / Computer programming / Automated theorem proving / Logic programming / Mathematical logic / Term / Substitution / Principia Mathematica / Free variables and bound variables / Monad](https://www.pdfsearch.io/img/b0c63e2523a3dbe5205fd88a98e20a84.jpg) Date: 2003-07-04 16:21:32Mathematics Logic Computer programming Automated theorem proving Logic programming Mathematical logic Term Substitution Principia Mathematica Free variables and bound variables Monad | | Reflecting Higher-Order Abstract Syntax in Nuprl? Eli Barzilay and Stuart Allen Cornell University {eli,sfa}@cs.cornell.edu Abstract. This document describes part of an effort to achieve in Nuprl a practical reflection oAdd to Reading ListSource URL: www.barzilay.orgDownload Document from Source Website File Size: 164,88 KBShare Document on Facebook
|