Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel†

First Page		Document Content
Date: 2014-12-08 09:42:38 Theoretical computer science Models of computation Logic in computer science Mathematical logic Software engineering Denotational semantics Computability theory Symbol Proof theory Lambda calculus Generalised Whitehead product Programming Computable Functions		Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel† Add to Reading List Source URL: www.lix.polytechnique.fr Download Document from Source Website File Size: 304,47 KB Share Document on Facebook

	Semantics of Interaction Samson Abramsky Abstract The “classical” paradigm for denotational semantics models data types as domains, i.e. structured sets of some kind, and programs as (suitable) functions between doma DocID: 1xToC - View Document
	Broadening the denotational semantics of linear logic Vaughan Pratt∗ Dept. of Computer Science Stanford University Stanford, CA DocID: 1u8nF - View Document
	Intro to Denotational Semantics Eric L. McCorkle December 13, 2015 Semantics DocID: 1tmhs - View Document
	The Semantics of Syntax Applying Denotational Semantics to Hygienic Macro Systems Neelakantan R. Krishnaswami University of Birmingham <> DocID: 1t428 - View Document
	A Type-Theoretic Interpretation of Standard ML Robert Harper and Christopher Stone frwh, School of Computer Science Carnegie Mellon University DocID: 1rrvD - View Document