TY - BOOK ID - 2482828 TI - Typed lambda calculi and applications. International conference, TLCA 93, March 1993, Utrecht, The Netherlands. Proceedings AU - BEZEM, Marc AU - GROOTE, Jan Frizo PY - 1993 VL - vol 664 SN - 3540565175 0387565175 3540475869 PB - Berlin : Springer-Verlag, DB - UniCat KW - Lambda calculus KW - Congresses KW - Lambda calculus - Congresses. KW - Information theory. KW - Logic, Symbolic and mathematical. KW - Computer science. KW - Logic design. KW - Theory of Computation. KW - Mathematical Logic and Foundations. KW - Mathematical Logic and Formal Languages. KW - Logics and Meanings of Programs. KW - Programming Techniques. KW - Informatics KW - Science KW - Algebra of logic KW - Logic, Universal KW - Mathematical logic KW - Symbolic and mathematical logic KW - Symbolic logic KW - Mathematics KW - Algebra, Abstract KW - Metamathematics KW - Set theory KW - Syllogism KW - Communication theory KW - Communication KW - Cybernetics KW - Design, Logic KW - Design of logic systems KW - Digital electronics KW - Electronic circuit design KW - Logic circuits KW - Machine theory KW - Switching theory UR - https://www.unicat.be/uniCat?func=search&query=sysid:2482828 AB - The lambda calculus was developed in the 1930s by Alonzo Church. The calculus turned out to be an interesting model of computation and became theprototype for untyped functional programming languages. Operational and denotational semantics for the calculus served as examples for otherprogramming languages. In typed lambda calculi, lambda terms are classified according to their applicative behavior. In the 1960s it was discovered that the types of typed lambda calculi are in fact appearances of logical propositions. Thus there are two possible views of typed lambda calculi: - as models of computation, where terms are viewed as programs in a typed programming language; - as logical theories, where the types are viewed as propositions and the terms as proofs. The practical spin-off from these studies are: - functional programming languages which are mathematically more succinct than imperative programs; - systems for automated proof checking based on lambda caluli. This volume is the proceedings of TLCA '93, the first international conference on Typed Lambda Calculi and Applications,organized by the Department of Philosophy of Utrecht University. It includes29 papers selected from 51 submissions. ER -