Proof pearl: using combinators to manipulate let-expressions in proof

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Original language	English
Title of host publication	Theorem Proving in Higher Order Logics: 18th international conference TPHOLs 2005, Oxford 2005, proceedings
Editors	Joe Hurd, Tom Helham
Place of Publication	United Kingdom
Publisher	Springer
Pages	397-408
Volume	1
Edition	1st
ISBN (Print)	3540283722
Publication status	Published - 2005

Name
Volume	LNCS 3603

Cite this

@inbook{3f2bedf6f85c455e98d4deb3e974bbf5,

title = "Proof pearl: using combinators to manipulate let-expressions in proof",

author = "Michael Norrish and Konrad Slind",

year = "2005",

language = "English",

isbn = "3540283722",

volume = "1",

publisher = "Springer",

pages = "397--408",

editor = "{Joe Hurd, Tom Helham}",

booktitle = "Theorem Proving in Higher Order Logics: 18th international conference TPHOLs 2005, Oxford 2005, proceedings",

edition = "1st",

}

Proof pearl: using combinators to manipulate let-expressions in proof. / Norrish, Michael; Slind, Konrad.
Theorem Proving in Higher Order Logics: 18th international conference TPHOLs 2005, Oxford 2005, proceedings. ed. / Joe Hurd, Tom Helham. Vol. 1 1st. ed. United Kingdom: Springer, 2005. p. 397-408.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Proof pearl: using combinators to manipulate let-expressions in proof

AU - Norrish, Michael

AU - Slind, Konrad

PY - 2005

Y1 - 2005

M3 - Chapter

SN - 3540283722

VL - 1

SP - 397

EP - 408

BT - Theorem Proving in Higher Order Logics: 18th international conference TPHOLs 2005, Oxford 2005, proceedings

A2 - null, Joe Hurd, Tom Helham

PB - Springer

CY - United Kingdom

ER -