
	Where results make sense

Topic: Typed lambda calculi

	Turing completeness - Wikipedia, the free encyclopedia
		The computational systems (algebras, calculi) that are discussed as Turing complete systems are those intended for studying theoretical computer science.
		Lambda calculus the original (Alonzo Church's paper predated Turing's, but Turing is credited for fuller explanation of the implications)
		The untyped lambda calculus is Turing-complete, but many typed lambda calculi, including System F, are not.
	en.wikipedia.org /wiki/Turing_completeness (916 words)

	Foundations of Mathematics
		Sequent Calculi for First-Order Logic - by Hans de Nivelle
		Lambda Calculus and Combinators - by Anthony Aaby
		Introduction to Lambda Calculus [compressed PS] - by Henk Barendregt, Erik Barendsen
	sakharov.net /foundation_rt.html (2708 words)

	Torben Braüner's Publications
		Proceedings of Third International Conference on Typed Lambda Calculi and Applications, Nancy, France, 1997, LNCS 1210, Springer-Verlag.
		A Simple Adequate Categorical Model for PCF, II.
		Extended version of paper in Proceedings of Third International Conference on Typed Lambda Calculi and Applications (4 out of 24 papers in the proceedings were selected for publication in this journal).
	akira.ruc.dk /~torben/publications.html (858 words)

Try your search on: Qwika (all wikis)