|
|
|
|
| LEADER |
11246cam a2201429 4500 |
| 001 |
183-595126723 |
| 003 |
DE-627 |
| 005 |
20240214204718.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
090328s1993 gw |||||o 00| ||eng c |
| 020 |
|
|
|a 9783540475866
|9 978-3-540-47586-6
|
| 024 |
7 |
|
|a 10.1007/BFb0037093
|2 doi
|
| 035 |
|
|
|a (DE-627)595126723
|
| 035 |
|
|
|a (DE-576)9595126721
|
| 035 |
|
|
|a (DE-599)GBV595126723
|
| 035 |
|
|
|a (DE-601)NLM003721582
|
| 035 |
|
|
|a (ZBM)0866.00038
|
| 035 |
|
|
|a (ZBM)0866.00038
|
| 035 |
|
|
|a (DE-He213)978-3-540-47586-6
|
| 035 |
|
|
|a (EBP)040483150
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 044 |
|
|
|c XA-DE-BE
|
| 050 |
|
0 |
|a QA9.5
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 084 |
|
|
|a 28
|2 sdnb
|
| 084 |
|
|
|a SS 4800
|q SEPA
|2 rvk
|0 (DE-625)rvk/143528:
|
| 084 |
|
|
|a ST 130
|q SEPA
|2 rvk
|0 (DE-625)rvk/143588:
|
| 084 |
|
|
|a *00B25
|2 msc
|
| 084 |
|
|
|a 03-06
|2 msc
|
| 084 |
|
|
|a 68-06
|2 msc
|
| 084 |
|
|
|a 03B40
|2 msc
|
| 084 |
|
|
|a 54.10
|2 bkl
|
| 084 |
|
|
|a 31.10
|2 bkl
|
| 084 |
|
|
|a 54.51
|2 bkl
|
| 245 |
1 |
0 |
|a Typed lambda calculi and applications
|b International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings
|c M. Bezem ... (eds.)
|
| 264 |
|
1 |
|a Berlin [u.a.]
|b Springer
|c 1993
|
| 300 |
|
|
|a Online-Ressource (VIII, 432 S.)
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Lecture notes in computer science
|v 664
|
| 500 |
|
|
|a Literaturangaben
|
| 520 |
|
|
|a On Mints' reduction for ccc-calculus -- A formalization of the strong normalization proof for System F in LEGO -- Partial intersection type assignment in applicative term rewriting systems -- Extracting constructive content from classical logic via control-like reductions -- Combining first and higher order rewrite systems with type assignment systems -- A term calculus for Intuitionistic Linear Logic -- Program extraction from normalization proofs -- A semantics for ? &-early: a calculus with overloading and early binding -- An abstract notion of application -- The undecidability of typability in the Lambda-Pi-calculus -- Recursive types are not conservative over F? -- The conservation theorem revisited -- Modified realizability toposes and strong normalization proofs -- Semantics of lambda-I and of other substructure lambda calculi -- Translating dependent type theory into higher order logic -- Studying the fully abstract model of PCF within its continuous function model -- A new characterization of lambda definability -- Combining recursive and dynamic types -- Lambda calculus characterizations of poly-time -- Pure type systems formalized -- Orthogonal higher-order rewrite systems are confluent -- Monotonic versus antimonotonic exponentiation -- Inductive definitions in the system Coq rules and properties -- Intersection types and bounded polymorphism -- A logic for parametric polymorphism -- Call-by-value and nondeterminism -- Lower and upper bounds for reductions of types in ? and ?P (extended abstract) -- ?-Calculi with conditional rules -- Type reconstruction in F? is undecidable.
|
| 520 |
|
|
|a 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.
|
| 533 |
|
|
|a Online-Ausg.
|b Berlin [u.a.]
|c Springer
|d 2006
|f Springer lecture notes archive
|7 |2006||||||||||
|
| 650 |
|
0 |
|a Logic design
|
| 650 |
|
0 |
|a Logic, Symbolic and mathematical
|
| 650 |
|
0 |
|a Computer science
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
4 |
|a Mathematical Logic and Formal Languages
|
| 650 |
|
4 |
|a Programming Techniques
|
| 650 |
|
4 |
|a Computer Science
|
| 650 |
|
4 |
|a Mathematical Logic and Foundations
|
| 650 |
|
4 |
|a Logics and Meanings of Programs
|
| 653 |
|
0 |
|a Lambda
|a Congresses
|
| 655 |
|
7 |
|a Konferenzschrift
|y 1993
|z Utrecht
|0 (DE-588)1071861417
|0 (DE-627)826484824
|0 (DE-576)433375485
|2 gnd-content
|
| 689 |
0 |
0 |
|D s
|0 (DE-588)4270792-4
|0 (DE-627)104511451
|0 (DE-576)210676256
|a Typisierter Lambda-Kalkül
|2 gnd
|
| 689 |
0 |
|
|5 DE-101
|
| 689 |
0 |
|
|5 (DE-627)
|
| 700 |
1 |
|
|a Bezem, Marc
|4 oth
|
| 711 |
2 |
|
|a International Conference on Typed Lambda Calculi and Applications
|n 1
|d 1993
|c Utrecht
|0 (DE-588)2127983-4
|0 (DE-627)122911156
|0 (DE-576)194355438
|4 oth
|
| 776 |
1 |
|
|z 3540565175
|
| 776 |
1 |
|
|z 9783540565178
|
| 776 |
0 |
8 |
|i Druckausg.
|t Typed lambda calculi and applications
|d Berlin : Springer, 1993
|h VIII, 432 S.
|w (DE-627)122886372
|w (DE-576)032526318
|z 3540565175
|z 0387565175
|
| 830 |
|
0 |
|a Lecture notes in computer science
|v 664
|9 66400
|w (DE-627)316228877
|w (DE-576)093890923
|w (DE-600)2018930-8
|x 1611-3349
|7 ns
|
| 856 |
4 |
0 |
|u http://www.springerlink.com/content/m65g43120w1h
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
0 |
|u http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-56517-8
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/BFb0037093
|x Resolving-System
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0037093
|m X:SPRINGER
|x Resolving-System
|z lizenzpflichtig
|
| 856 |
4 |
2 |
|u https://zbmath.org/?q=an:0866.00038
|m B:ZBM
|v 2021-04-12
|x Verlag
|y Zentralblatt MATH
|3 Inhaltstext
|
| 912 |
|
|
|a ZDB-1-SLN
|
| 912 |
|
|
|a ZDB-2-LNC
|b 1993
|
| 912 |
|
|
|a ZDB-2-SCS
|b 1993
|
| 912 |
|
|
|a ZDB-2-BAE
|b 1993
|
| 912 |
|
|
|a ZDB-2-SXCS
|b 1993
|
| 912 |
|
|
|a ZDB-2-SEB
|b 1993
|
| 912 |
|
|
|a SSG-OPC-mat
|
| 924 |
1 |
|
|a 1221298585
|b DE-1a
|9 1a
|c GBV
|d d
|h 5:INTERN
|k http://erf.sbb.spk-berlin.de/han/512881081/dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202667057
|b DE-84
|9 84
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 201777290
|b DE-46
|9 46
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1162771380
|b DE-18
|9 18
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|k http://emedien.sub.uni-hamburg.de/han/SpringerEbooks/dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202426300
|b DE-830
|9 830
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202690725
|b DE-8
|9 8
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 3503727124
|b DE-104
|9 104
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1114763772
|b DE-27
|9 27
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202731871
|b DE-Ilm1
|9 Ilm 1
|c GBV
|d d
|g Online-Ressource
|h Internet
|
| 924 |
1 |
|
|a 127348732X
|b DE-7
|9 7
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|k http://han.sub.uni-goettingen.de/han/SpringerLectureNotesinComputerScience/dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1159774323
|b DE-705
|9 705
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202643379
|b DE-28
|9 28
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202702553
|b DE-Wim2
|9 Wim 2
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202631532
|b DE-3
|9 3
|c GBV
|d d
|g ebook
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1173496734
|b DE-9
|9 9
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1670357104
|b DE-95
|9 95
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1196440948
|b DE-Ma9
|9 Ma 9
|c GBV
|d d
|g ebook SpringerLectureNotes
|k http://dx.doi.org/10.1007/BFb0037093
|k http://han.med.uni-magdeburg.de/han/NLUNIeBookSpringerLectureNotes/dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1196477485
|b DE-Ma14
|9 Ma 14
|c GBV
|d d
|g ebook SpringerLectureNotes
|k http://dx.doi.org/10.1007/BFb0037093
|k http://han.med.uni-magdeburg.de/han/NLUNIeBookSpringerLectureNotes/dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1217416552
|b DE-Luen4
|9 Lün 4
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1586808737
|b DE-Kt1
|9 Kt 1
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 927646129
|b DE-715
|9 715
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1755088566
|b DE-715
|9 715
|c GBV
|d d
|k http://49gbv-uob-primo.hosted.exlibrisgroup.com/openurl/49GBV_UOB/UOB_services_page?u.ignore_date_coverage=true&rft.mms_id=991010473029703501
|l Springer Lecture Notes [Nationallizenz]
|l Campusweiter Zugriff (Universität Oldenburg). - Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden.
|
| 924 |
1 |
|
|a 202655210
|b DE-700
|9 700
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 3848426226
|b DE-Wis1
|9 Wis 1
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1263874630
|b DE-755
|9 755
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1172947686
|b DE-960
|9 960
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 203361881
|b DE-916
|9 916
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 182352799X
|b DE-Ki95
|9 Ki 95
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1222077051
|b DE-H155
|9 H 155
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 202678881
|b DE-517
|9 517
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 1172991367
|b DE-960-3
|9 960/3
|c GBV
|d d
|k http://dx.doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 4484379090
|b DE-14
|9 14
|c BSZ
|d d
|k https://doi.org/10.1007/BFb0037093
|
| 924 |
1 |
|
|a 4484379104
|b DE-576
|9 576
|c BSZ
|d d
|
| 924 |
1 |
|
|a 4484338688
|b DE-Ofb1
|9 Ofb 1
|c BSZ
|d d
|g E-Book Springer
|k https://doi.org/10.1007/BFb0037093
|l Zum Online-Dokument
|l Zugang im Hochschulnetz der HS Offenburg / extern via VPN oder Shibboleth (Login über Institution)
|
| 936 |
r |
v |
|a SS 4800
|b Lecture notes in computer science
|k Informatik
|k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen
|k Schriftenreihen (indiv. Sign.)
|k Lecture notes in computer science
|0 (DE-627)1271461242
|0 (DE-625)rvk/143528:
|0 (DE-576)201461242
|
| 936 |
r |
v |
|a ST 130
|b Allgemeines
|k Informatik
|k Monografien
|k Grundlagen der Informatik
|k Theoretische Informatik
|k Allgemeines
|0 (DE-627)1270877461
|0 (DE-625)rvk/143588:
|0 (DE-576)200877461
|
| 936 |
b |
k |
|a 54.10
|j Theoretische Informatik
|0 (DE-627)106418815
|
| 936 |
b |
k |
|a 31.10
|j Mathematische Logik
|j Mengenlehre
|0 (DE-627)10640847X
|
| 936 |
b |
k |
|a 54.51
|j Programmiermethodik
|0 (DE-627)106418122
|
| 951 |
|
|
|a BO
|
| 980 |
|
|
|a 595126723
|b 183
|c sid-183-col-kxpbbi
|
SOLR
| _version_ |
1795393478917619712 |
| author2 |
Bezem, Marc |
| author2_role |
oth |
| author2_variant |
m b mb |
| author_corporate |
International Conference on Typed Lambda Calculi and Applications |
| author_corporate_role |
oth |
| author_facet |
Bezem, Marc, International Conference on Typed Lambda Calculi and Applications |
| building |
Library A |
| callnumber-first |
Q - Science |
| callnumber-label |
QA9 |
| callnumber-raw |
QA9.5 |
| callnumber-search |
QA9.5 |
| callnumber-sort |
QA 19.5 |
| callnumber-subject |
QA - Mathematics |
| collection |
ZDB-1-SLN, ZDB-2-LNC, ZDB-2-SCS, ZDB-2-BAE, ZDB-2-SXCS, ZDB-2-SEB, SSG-OPC-mat, sid-183-col-kxpbbi |
| contents |
On Mints' reduction for ccc-calculus -- A formalization of the strong normalization proof for System F in LEGO -- Partial intersection type assignment in applicative term rewriting systems -- Extracting constructive content from classical logic via control-like reductions -- Combining first and higher order rewrite systems with type assignment systems -- A term calculus for Intuitionistic Linear Logic -- Program extraction from normalization proofs -- A semantics for ? &-early: a calculus with overloading and early binding -- An abstract notion of application -- The undecidability of typability in the Lambda-Pi-calculus -- Recursive types are not conservative over F? -- The conservation theorem revisited -- Modified realizability toposes and strong normalization proofs -- Semantics of lambda-I and of other substructure lambda calculi -- Translating dependent type theory into higher order logic -- Studying the fully abstract model of PCF within its continuous function model -- A new characterization of lambda definability -- Combining recursive and dynamic types -- Lambda calculus characterizations of poly-time -- Pure type systems formalized -- Orthogonal higher-order rewrite systems are confluent -- Monotonic versus antimonotonic exponentiation -- Inductive definitions in the system Coq rules and properties -- Intersection types and bounded polymorphism -- A logic for parametric polymorphism -- Call-by-value and nondeterminism -- Lower and upper bounds for reductions of types in ? and ?P (extended abstract) -- ?-Calculi with conditional rules -- Type reconstruction in F? is undecidable., 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. |
| ctrlnum |
(DE-627)595126723, (DE-576)9595126721, (DE-599)GBV595126723, (DE-601)NLM003721582, (ZBM)0866.00038, (DE-He213)978-3-540-47586-6, (EBP)040483150 |
| doi_str_mv |
10.1007/BFb0037093 |
| era_facet |
1993 |
| facet_912a |
ZDB-1-SLN, ZDB-2-LNC, ZDB-2-SCS, ZDB-2-BAE, ZDB-2-SXCS, ZDB-2-SEB, SSG-OPC-mat |
| facet_avail |
Online |
| facet_local_del330 |
Typisierter Lambda-Kalkül |
| facet_topic_nrw_music |
Lambda, Congresses |
| finc_class_facet |
Informatik, Mathematik |
| fincclass_txtF_mv |
science-computerscience, science-mathematics |
| footnote |
Literaturangaben |
| format |
eBook, ConferenceProceedings |
| format_access_txtF_mv |
Book, E-Book |
| format_de105 |
Ebook |
| format_de14 |
Book, E-Book |
| format_de15 |
Book, E-Book |
| format_del152 |
Buch |
| format_detail_txtF_mv |
text-online-monograph-independent-conference |
| format_dezi4 |
e-Book |
| format_finc |
Book, E-Book |
| format_legacy |
ElectronicBook |
| format_legacy_nrw |
Book, E-Book |
| format_nrw |
Book, E-Book |
| format_strict_txtF_mv |
E-Book |
| genre |
Konferenzschrift 1993 Utrecht (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content |
| genre_facet |
Konferenzschrift |
| geogr_code |
not assigned |
| geogr_code_person |
not assigned |
| geographic_facet |
Utrecht |
| hierarchy_parent_id |
183-316228877 |
| hierarchy_parent_title |
Lecture notes in computer science |
| hierarchy_sequence |
66400 |
| hierarchy_top_id |
183-316228877 |
| hierarchy_top_title |
Lecture notes in computer science |
| id |
183-595126723 |
| illustrated |
Not Illustrated |
| imprint |
Berlin [u.a.], Springer, 1993 |
| imprint_str_mv |
Berlin [u.a.]: Springer, 1993, Online-Ausg.: Berlin [u.a.]: Springer, 2006 |
| institution |
FID-BBI-DE-23 |
| is_hierarchy_id |
183-595126723 |
| is_hierarchy_title |
Typed lambda calculi and applications: International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings |
| isbn |
9783540475866 |
| isbn_isn_mv |
3540565175, 9783540565178, 0387565175 |
| issn_isn_mv |
1611-3349 |
| language |
English |
| last_indexed |
2024-04-04T08:50:47.786Z |
| marc024a_ct_mv |
10.1007/BFb0037093 |
| marc_error |
[geogr_code]Unable to make public java.lang.AbstractStringBuilder java.lang.AbstractStringBuilder.append(java.lang.String) accessible: module java.base does not "opens java.lang" to unnamed module @289001a2 |
| match_str |
bezem1993typedlambdacalculiandapplicationsinternationalconferenceontypedlambdacalculiandapplicationstlca93march16181993utrechtthenetherlandsproceedings |
| mega_collection |
K10plus Verbundkatalog, Springer Lecture Notes |
| multipart_link |
093890923 |
| multipart_part |
(093890923)664 |
| physical |
Online-Ressource (VIII, 432 S.) |
| publishDate |
1993 |
| publishDateSort |
1993 |
| publishPlace |
Berlin [u.a.] |
| publisher |
Springer |
| record_format |
marcfinc |
| record_id |
595126723 |
| recordtype |
marcfinc |
| rvk_facet |
SS 4800, ST 130 |
| rvk_label |
Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science, Monografien, Grundlagen der Informatik, Theoretische Informatik, Allgemeines |
| rvk_path |
SS, ST, SQ - SU, SS 4000 - SS 5999, SS 4800, ST 120 - ST 140, ST 130 - ST 140, ST 130 |
| rvk_path_str_mv |
SS, ST, SQ - SU, SS 4000 - SS 5999, SS 4800, ST 120 - ST 140, ST 130 - ST 140, ST 130 |
| series |
Lecture notes in computer science, 664 |
| series2 |
Lecture notes in computer science ; 664 |
| source_id |
183 |
| spelling |
Typed lambda calculi and applications International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings M. Bezem ... (eds.), Berlin [u.a.] Springer 1993, Online-Ressource (VIII, 432 S.), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture notes in computer science 664, Literaturangaben, On Mints' reduction for ccc-calculus -- A formalization of the strong normalization proof for System F in LEGO -- Partial intersection type assignment in applicative term rewriting systems -- Extracting constructive content from classical logic via control-like reductions -- Combining first and higher order rewrite systems with type assignment systems -- A term calculus for Intuitionistic Linear Logic -- Program extraction from normalization proofs -- A semantics for ? &-early: a calculus with overloading and early binding -- An abstract notion of application -- The undecidability of typability in the Lambda-Pi-calculus -- Recursive types are not conservative over F? -- The conservation theorem revisited -- Modified realizability toposes and strong normalization proofs -- Semantics of lambda-I and of other substructure lambda calculi -- Translating dependent type theory into higher order logic -- Studying the fully abstract model of PCF within its continuous function model -- A new characterization of lambda definability -- Combining recursive and dynamic types -- Lambda calculus characterizations of poly-time -- Pure type systems formalized -- Orthogonal higher-order rewrite systems are confluent -- Monotonic versus antimonotonic exponentiation -- Inductive definitions in the system Coq rules and properties -- Intersection types and bounded polymorphism -- A logic for parametric polymorphism -- Call-by-value and nondeterminism -- Lower and upper bounds for reductions of types in ? and ?P (extended abstract) -- ?-Calculi with conditional rules -- Type reconstruction in F? is undecidable., 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., Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive |2006||||||||||, Logic design, Logic, Symbolic and mathematical, Computer science, Mathematical logic., Machine theory., Computer programming., Mathematical Logic and Formal Languages, Programming Techniques, Computer Science, Mathematical Logic and Foundations, Logics and Meanings of Programs, Lambda Congresses, Konferenzschrift 1993 Utrecht (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4270792-4 (DE-627)104511451 (DE-576)210676256 Typisierter Lambda-Kalkül gnd, DE-101, (DE-627), Bezem, Marc oth, International Conference on Typed Lambda Calculi and Applications 1 1993 Utrecht (DE-588)2127983-4 (DE-627)122911156 (DE-576)194355438 oth, 3540565175, 9783540565178, Druckausg. Typed lambda calculi and applications Berlin : Springer, 1993 VIII, 432 S. (DE-627)122886372 (DE-576)032526318 3540565175 0387565175, Lecture notes in computer science 664 66400 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, http://www.springerlink.com/content/m65g43120w1h Verlag lizenzpflichtig Volltext, http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-56517-8 Verlag lizenzpflichtig Volltext, http://dx.doi.org/10.1007/BFb0037093 Resolving-System lizenzpflichtig Volltext, https://doi.org/10.1007/BFb0037093 X:SPRINGER Resolving-System lizenzpflichtig, https://zbmath.org/?q=an:0866.00038 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext |
| spellingShingle |
Typed lambda calculi and applications: International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings, Lecture notes in computer science, 664, On Mints' reduction for ccc-calculus -- A formalization of the strong normalization proof for System F in LEGO -- Partial intersection type assignment in applicative term rewriting systems -- Extracting constructive content from classical logic via control-like reductions -- Combining first and higher order rewrite systems with type assignment systems -- A term calculus for Intuitionistic Linear Logic -- Program extraction from normalization proofs -- A semantics for ? &-early: a calculus with overloading and early binding -- An abstract notion of application -- The undecidability of typability in the Lambda-Pi-calculus -- Recursive types are not conservative over F? -- The conservation theorem revisited -- Modified realizability toposes and strong normalization proofs -- Semantics of lambda-I and of other substructure lambda calculi -- Translating dependent type theory into higher order logic -- Studying the fully abstract model of PCF within its continuous function model -- A new characterization of lambda definability -- Combining recursive and dynamic types -- Lambda calculus characterizations of poly-time -- Pure type systems formalized -- Orthogonal higher-order rewrite systems are confluent -- Monotonic versus antimonotonic exponentiation -- Inductive definitions in the system Coq rules and properties -- Intersection types and bounded polymorphism -- A logic for parametric polymorphism -- Call-by-value and nondeterminism -- Lower and upper bounds for reductions of types in ? and ?P (extended abstract) -- ?-Calculi with conditional rules -- Type reconstruction in F? is undecidable., 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., Logic design, Logic, Symbolic and mathematical, Computer science, Mathematical logic., Machine theory., Computer programming., Mathematical Logic and Formal Languages, Programming Techniques, Computer Science, Mathematical Logic and Foundations, Logics and Meanings of Programs, Lambda, Congresses, Konferenzschrift 1993 Utrecht, Typisierter Lambda-Kalkül |
| title |
Typed lambda calculi and applications: International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings |
| title_auth |
Typed lambda calculi and applications International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings |
| title_full |
Typed lambda calculi and applications International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings M. Bezem ... (eds.) |
| title_fullStr |
Typed lambda calculi and applications International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings M. Bezem ... (eds.) |
| title_full_unstemmed |
Typed lambda calculi and applications International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings M. Bezem ... (eds.) |
| title_in_hierarchy |
664. Typed lambda calculi and applications: International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings (1993) |
| title_short |
Typed lambda calculi and applications |
| title_sort |
typed lambda calculi and applications international conference on typed lambda calculi and applications, tlca '93, march, 16 - 18, 1993, utrecht, the netherlands ; proceedings |
| title_sub |
International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings |
| title_unstemmed |
Typed lambda calculi and applications: International Conference on Typed Lambda Calculi and Applications, TLCA '93, March, 16 - 18, 1993, Utrecht, The Netherlands ; proceedings |
| topic |
Logic design, Logic, Symbolic and mathematical, Computer science, Mathematical logic., Machine theory., Computer programming., Mathematical Logic and Formal Languages, Programming Techniques, Computer Science, Mathematical Logic and Foundations, Logics and Meanings of Programs, Lambda, Congresses, Konferenzschrift 1993 Utrecht, Typisierter Lambda-Kalkül |
| topic_facet |
Logic design, Logic, Symbolic and mathematical, Computer science, Mathematical logic., Machine theory., Computer programming., Mathematical Logic and Formal Languages, Programming Techniques, Computer Science, Mathematical Logic and Foundations, Logics and Meanings of Programs, Konferenzschrift, Typisierter Lambda-Kalkül, Lambda, Congresses |
| url |
http://www.springerlink.com/content/m65g43120w1h, http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-56517-8, http://dx.doi.org/10.1007/BFb0037093, https://doi.org/10.1007/BFb0037093, https://zbmath.org/?q=an:0866.00038 |
| work_keys_str_mv |
AT bezemmarc typedlambdacalculiandapplicationsinternationalconferenceontypedlambdacalculiandapplicationstlca93march16181993utrechtthenetherlandsproceedings, AT internationalconferenceontypedlambdacalculiandapplicationsutrecht typedlambdacalculiandapplicationsinternationalconferenceontypedlambdacalculiandapplicationstlca93march16181993utrechtthenetherlandsproceedings |