Exceptions Are Strictly More Powerful Than Call Cc

Exceptions Are Strictly More Powerful Than Call Cc (1995)

by Mark Lillibridge

Venue:	HigherOrder and Symbolic Computation
Citations:	11 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Exceptions Are Strictly More Powerful Than Call Cc	user correction - Legacy Corrections
AUTHOR NAME	Mark Lillibridge	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, PA 15213	SVM HeaderParse 0.1
ABSTRACT	We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions are strictly more powerful than call/cc. More precisely, we prove that the simply typed lambda calculus extended with exceptions is strictly more powerful than Girard's F [6, 15] (a superset of the simply typed lambda calculus) extended with call/cc and abort. This result is established by showing that the first language is Turing equivalent while the second language permits only a subset of the recursive functions to be written. We show that the simply typed lambda calculus extended with exceptions is Turing equivalent by reducing the untyped lambda calculus to it by means of a novel method for simulating recursive types using exception-returning functions. The result concerning F extended with call/cc is from a previous paper of the author and Robert Harper's.	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	HigherOrder and Symbolic Computation	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
VOLUME	13	INFERENCE
TECH	Technical Report CMU-CS-95-178	INFERENCE
CITATIONS	3 found	ParsCit 1.0