Recursive function definition for types with binders
dc.contributor.author | Norrish, Michael | |
dc.date.accessioned | 2015-12-13T23:11:28Z | |
dc.date.issued | 2004 | |
dc.date.updated | 2015-12-12T08:27:48Z | |
dc.description.abstract | This work describes the proof and uses of a theorem allowing definition of recursive functions over the type of λ-calculus terms, where terms with bound variables are identified up to α-equivalence. The theorem embodies what is effectively a principle o | |
dc.identifier.isbn | 3540230173 | |
dc.identifier.uri | http://hdl.handle.net/1885/87609 | |
dc.publisher | Springer | |
dc.relation.ispartof | Theorem Proving in Higher Order Logics: 17th international conference, TPHOLs 2004 | |
dc.relation.isversionof | 1st Edition | |
dc.title | Recursive function definition for types with binders | |
dc.type | Book chapter | |
local.bibliographicCitation.lastpage | 256 | |
local.bibliographicCitation.placeofpublication | Berlin, Germany | |
local.bibliographicCitation.startpage | 241 | |
local.contributor.affiliation | Norrish, Michael, College of Engineering and Computer Science, ANU | |
local.contributor.authoremail | u4087502@anu.edu.au | |
local.contributor.authoruid | Norrish, Michael, u4087502 | |
local.description.embargo | 2037-12-31 | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
local.identifier.absfor | 080203 - Computational Logic and Formal Languages | |
local.identifier.ariespublication | MigratedxPub16966 | |
local.identifier.scopusID | 2-s2.0-35048868796 | |
local.identifier.uidSubmittedBy | Migrated | |
local.type.status | Published Version |
Downloads
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- 01_Norrish_Recursive_function_definition_2004.pdf
- Size:
- 130.29 KB
- Format:
- Adobe Portable Document Format