UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

A formalised first-order confluence proof for the lambda-calculus using one-sorted variable names

Vestergaard, R; Brotherston, J; (2003) A formalised first-order confluence proof for the lambda-calculus using one-sorted variable names. INFORMATION AND COMPUTATION , 183 (2) pp. 212-244. 10.1016/S0890-5401(03)00023-3.

Full text not available from this repository.
Type: Article
Title: A formalised first-order confluence proof for the lambda-calculus using one-sorted variable names
Location: UTRECHT UNIV, UTRECHT, NETHERLANDS
DOI: 10.1016/S0890-5401(03)00023-3
Keywords: Science & Technology, Technology, Physical Sciences, Computer Science, Theory & Methods, Mathematics, Applied, Computer Science, Mathematics, COMPUTER SCIENCE, THEORY & METHODS, MATHEMATICS, APPLIED, lambda-calculus, structural induction and recursion, confluence, theorem proving, Barendregt's Variable Convention
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/1353144
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item