000 04191nam a22006015i 4500
001 978-3-540-68438-1
003 DE-He213
005 20240423132545.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540684381
_9978-3-540-68438-1
024 7 _a10.1007/3-540-62688-3
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTyped Lambda Calculi and Applications
_h[electronic resource] :
_bThird International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings /
_cedited by Philippe de Groote, J. Roger Hindley.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aVIII, 412 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1210
505 0 _aA ?-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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aComputer programming.
650 0 _aMathematical logic.
650 1 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aProgramming Techniques.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aGroote, Philippe de.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHindley, J. Roger.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540626886
776 0 8 _iPrinted edition:
_z9783662163900
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1210
856 4 0 _uhttps://doi.org/10.1007/3-540-62688-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189084
_d189084