Typed Normal Form Bisimulation Soren B. Lassen1 and Paul Blain Levy2 1 2

First Page		Document Content
Date: 2007-12-20 12:37:08 Logic in computer science Lambda calculus Process calculi Π-calculus Bisimulation Combinatory logic Fixed-point combinator Sheaf Theoretical computer science Applied mathematics Mathematics		Typed Normal Form Bisimulation Soren B. Lassen1 and Paul Blain Levy2 1 2 Add to Reading List Source URL: www.cs.bham.ac.uk Download Document from Source Website File Size: 231,10 KB Share Document on Facebook

	Problem Solving, Programming, and Calculation Björn Lisper School of Innovation, Design, and Engineering Mälardalen University http://www.idt.mdh.se/˜blr/ DocID: 1qLWC - View Document
	A Self-Hosting Evaluator using HOAS A Scheme Pearl Eli Barzilay Northeastern University DocID: 1pcZU - View Document
	Self-applicable Partial Evaluation for Pure Lambda Calculus Torben Æ. Mogensen DIKU, University of Copenhagen, Denmark Abstract DocID: 1oZ9H - View Document
	02157 Functional programming Michael R. Hansen DTU Informatics November 24, 2011 Revised October 21, 2013 DocID: 1oNH7 - View Document
	c ACM, 2010. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of ICFP 2010, ISBN DocID: 1oCsT - View Document