03970nam a22005895i 4500
978-3-540-68438-1
DE-He213
20170515111447.0
cr nn 008mamaa
121227s1997 gw | s |||| 0|eng d
9783540684381
978-3-540-68438-1
10.1007/3-540-62688-3
doi
QA75.5-76.95
UY
bicssc
UYA
bicssc
COM014000
bisacsh
COM031000
bisacsh
004.0151
23
Typed Lambda Calculi and Applications
[electronic resource] :
Third International Conference on Typed Lambda Calculi and Applications TLCA '97 Nancy, France, April 2–4, 1997 Proceedings /
edited by Philippe de Groote, J. Roger Hindley.
Berlin, Heidelberg :
Springer Berlin Heidelberg,
1997.
VIII, 412 p.
online resource.
text
txt
rdacontent
computer
c
rdamedia
online resource
cr
rdacarrier
text file
PDF
rda
Lecture Notes in Computer Science,
0302-9743 ;
1210
A ?-to-CL translation for strong normalization -- Typed intermediate languages for shape analysis -- Minimum information code in a pure functional language with data types -- Matching constraints for the Lambda Calculus of Objects -- Coinductive axiomatization of recursive type equality and subtyping -- A simple adequate categorical model for PCF -- Logical reconstruction of bi-domains -- A module calculus for pure type systems -- An inference algorithm for strictness -- Primitive recursion for higher-order abstract syntax -- Eta-expansions in dependent type theory — The calculus of constructions -- Proof nets, garbage, and computations -- Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi -- Games and weak-head reduction for classical PCF -- A type theoretical view of Böhm-trees -- Semantic techniques for deriving coinductive characterizations of observational equivalences for ?-calculi -- Schwichtenberg-style lambda definability is undecidable -- Outermost-fair rewriting -- Pomset logic: A non-commutative extension of classical linear logic -- Computational reflection in the calculus of constructions and its application to theorem proving -- Names, equations, relations: Practical ways to reason about new -- An axiomatic system of parametricity -- Inhabitation in typed lambda-calculi (a syntactic approach) -- Weak and strong beta normalisations in typed ?-calculi.
This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997. The 24 revised full papers presented in the book were carefully selected from a total of 54 submissions. The book reports the main research advances achieved in the area of typed lambda calculi since the predecessor conference, held in 1995, and competently reflects the state of the art in the area.
Computer science.
Computer programming.
Computers.
Computer logic.
Mathematical logic.
Computer Science.
Theory of Computation.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Foundations.
Groote, Philippe de.
editor.
Roger Hindley, J.
editor.
SpringerLink (Online service)
Springer eBooks
Printed edition:
9783540626886
Lecture Notes in Computer Science,
0302-9743 ;
1210
http://dx.doi.org/10.1007/3-540-62688-3
ZDB-2-SCS
ZDB-2-LNC
ZDB-2-BAE
ddc
EB
Computer Science (Springer-11645)
14285
14285