A formal treatment of the Barendregt variable convention in rule inductions

Simple item page
dc.contributor.authorUrban, Christian
dc.contributor.authorNorrish, Michael
dc.coverage.spatialTallinn Estonia
dc.date.accessioned2015-12-13T22:58:12Z
dc.date.available2015-12-13T22:58:12Z
dc.date.createdSeptember 30 2005
dc.date.issued2005
dc.date.updated2015-12-12T07:21:37Z
dc.identifier.isbn1595930728
dc.identifier.urihttp://hdl.handle.net/1885/83353
dc.publisherAssociation for Computing Machinery Inc (ACM)
dc.relation.ispartofseriesACM SIGPLAN Workshop on MEchanized Reasoning about Languages with VarIable BiNding (MERLIN 2005)
dc.sourceMERLIN 2005: Proceedings of the Third ACM SIGPLAN Workshop on MEchanized Reasoning about Languages with varIable biNding
dc.source.urihttp://users.rsise.anu.edu.au/~michaeln/pubs/merlin2005.pdf
dc.titleA formal treatment of the Barendregt variable convention in rule inductions
dc.typeConference paper
local.bibliographicCitation.lastpage32
local.bibliographicCitation.startpage25
local.contributor.affiliationUrban, Christian, Ludwig Maximilian University of Munich
local.contributor.affiliationNorrish, Michael, College of Engineering and Computer Science, ANU
local.contributor.authoruidNorrish, Michael, u4087502
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.ariespublicationMigratedxPub11602
local.type.statusPublished Version

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS