Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | German |
| Veröffentlicht: |
München
Dr. Hut Verlag
2008
|
| Ausgabe: | 1. Aufl. |
| Schriftenreihe: | Informatik
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXX, 358 S. 210 mm x 148 mm, 505 gr. |
| ISBN: | 9783899638660 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035276388 | ||
| 003 | DE-604 | ||
| 005 | 20100219 | ||
| 007 | t | ||
| 008 | 090128s2008 m||| 00||| ger d | ||
| 016 | 7 | |a 992163102 |2 DE-101 | |
| 020 | |a 9783899638660 |c PB. : EUR 63.00 |9 978-3-89963-866-0 | ||
| 024 | 3 | |a 9783899638660 | |
| 035 | |a (OCoLC)423749520 | ||
| 035 | |a (DE-599)DNB992163102 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 |a DE-91G | ||
| 082 | 0 | |a 005.131 |2 22/ger | |
| 084 | |a DAT 544d |2 stub | ||
| 084 | |a DAT 557d |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Sabel, David |d 1977- |e Verfasser |0 (DE-588)136885403 |4 aut | |
| 245 | 1 | 0 | |a Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence |c David Sabel |
| 250 | |a 1. Aufl. | ||
| 264 | 1 | |a München |b Dr. Hut Verlag |c 2008 | |
| 300 | |a XXX, 358 S. |c 210 mm x 148 mm, 505 gr. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Informatik | |
| 502 | |a Zugl.: Frankfurt am Main, Univ., Diss., 2008 | ||
| 650 | 4 | |a Programmtransformation - Korrektheit - Programmiersprache - Nebenläufigkeit - Abstrakter Automat - Lambda-Kalkül | |
| 650 | 0 | 7 | |a Lambda-Kalkül |0 (DE-588)4166495-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmtransformation |0 (DE-588)4263654-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Korrektheit |0 (DE-588)4240223-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Abstrakter Automat |0 (DE-588)4141155-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Programmtransformation |0 (DE-588)4263654-1 |D s |
| 689 | 0 | 1 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
| 689 | 0 | 2 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 0 | 3 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |D s |
| 689 | 0 | 4 | |a Abstrakter Automat |0 (DE-588)4141155-9 |D s |
| 689 | 0 | 5 | |a Lambda-Kalkül |0 (DE-588)4166495-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017081676&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017081676 | ||
Datensatz im Suchindex
| _version_ | 1804138566400344064 |
|---|---|
| adam_text | CONTENTS ABSTRACT III ZUSAMMENFASSUNG (GERMAN ABSTRACT) XI PREFACE XXI 1
INTRODUCTION AND BACKGROUND 1 1.1 MOTIVATION AND SURVEY 1 1.1.1 AN
ADEQUATE MODEL FOR CONCURRENT PROGRAM- MING LANGUAGES 6 1.1.2
OPERATIONAL SEMANTICS AS FORMAL SEMANTICS .... 11 1.1.3 PROGRAM
EQUIVALENCE 15 1.1.4 PROVING PROGRAM EQUIVALENCE 19 1.2 RESULTS 21 1.3
THE LAMBDA CALCULUS AND EXTENSIONS 24 1.3.1 CLASSICAL LAMBDA CALCULUS 24
1.3.2 REDUCTION STRATEGIES 26 1.3.3 EXTENSIONS OF THE UNTYPED LAMBDA
CALCULUS ... 30 1.3.3.1 DATA-CONSTRUCTORS AND CASE-EXPRESSIONS . 31
1.3.3.2 RECURSION 33 1.3.3.3 SEQUENTIAL COMPUTATIONS 34 1.3.4
NONDETERMINISM 35 1.4 OUTLINE 37 2 THE NONDETERMINISTIC CALL-BY-NEED
CALCULUS AE, 41 2.1 THE LANGUAGE OF A 1 ^ 43 2.1.1 THE SYNTAX OF THE
LANGUAGE 44 2.1.2 BOUND AND FREE VARIABLES 45 2.1.3 CONTEXTS 48 2.2
OPERATIONAL SEMANTICS 48 BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/992163102 DIGITALISIERT DURCH XXVI CONTENTS 2.2.1
NOTATION FOR RELATIONS 49 2.2.2 REDUCTION RULES 50 2.2.3 REDUCTION
CONTEXTS 55 2.2.4 NORMAL ORDER REDUCTION 56 2.2.5 PROPERTIES OF THE
(ILL)-REDUCTION 64 2.3 CONVERGENCE AND DIVERGENCE 66 2.3.1 A
CO-INDUCTIVE DEFINITION OF MUST-DIVERGENCE . . 68 2.3.2 A CO-INDUCTIVE
DEFINITION OF MUST-CONVERGENCE . 71 2.4 FAIRNESS 74 2.4.1 FAIR
EVALUATION IN NORMAL ORDER 76 2.4.2 FAIR CONVERGENCE AND FAIR DIVERGENCE
80 2.4.3 COINCIDENCE OF MAY- AND MUST-CONVERGENCE WITH FAIR MAY- AND
MUST-CONVERGENCE 81 2.5 ENCODING OF NONDETERMINISTIC AND PARALLEL
OPERATORS ... 86 2.5.1 THE OPERATOR PAR 87 2.5.2 THE OPERATOR SPAR 88
2.5.3 ERRATIC CHOICE 88 2.5.4 DEMONIC CHOICE 89 2.5.5 PARALLEL
CONVERGENCE TESTER 89 2.5.6 PARALLEL-OR 89 2.5.7 NONDETERMINISTIC MERGE
90 3 CONTEXTUAL EQUIVALENCE AND CORRECTNESS OF PROGRAM TRANSFOR- MATIONS
93 3.1 CONTEXTUAL EQUIVALENCE 97 3.2 CONTEXT LEMMAS 100 3.3 FRAMEWORK
FOR PROVING CORRECTNESS OF PROGRAM TRANSFOR- MATIONS 106 3.3.1 SURFACE
CONTEXTS AND CLOSURE OF TRANSFORMATIONS . 107 3.3.2 SUFFICIENT CRITERIA
FOR CORRECTNESS OF PROGRAM TRANSFORMATIONS 109 3.3.3 COMPLETE SETS OF
COMMUTING AND FORKING DIA- GRAMS 114 3.4 CORRECTNESS OF (IBETA) AND
(CASE-C) AND (SEQ-C) 118 3.5 ADDITIONAL CORRECT PROGRAM TRANSFORMATIONS
120 3.5. CONTENTS XXVII 3.5.3 DIAGRAMS FOR (XCH) 124 3.5.4 DIAGRAMS FOR
(ABS) 124 3.5.5 DIAGRAMS FOR (CPCX) 125 3.5.6 CORRECTNESS OF (OPT) 126
3.6 CORRECTNESS OF DETERMINISTIC REDUCTION RULES 130 3.6.1 CORRECTNESS
OF (CASE) 131 3.6.2 CORRECTNESS OF (III) 132 3.6.2.1 DIAGRAMS FOR (LAEPP)
AND (ICASE) AND (ISEQ) 132 3.6.2.2 DIAGRAMS FOR (LAMB) 132 3.6.2.3
DIAGRAMS FOR (MET) 135 3.6.2.4 PROVING CORRECTNESS OF (III) 137 3.6.3
CORRECTNESS OF (CP) 143 3.6.4 CORRECTNESS OF (SEQ) 147 3.6.5 SUMMARY 148
3.7 UNIQUE COPYING 148 3.7.1 CORRECTNESS OF UNIQUE COPYING 149 3.7.2
CORRECTNESS OF (ISEQR) AND (LAPPR) AND (ICONS) .... 159 STANDARDIZATION
AND SUCCESSOR SET-BASED PROOF TECHNIQUE 161 4.1 NORMAL ORDER REDUCTION
IS STANDARDIZING 165 4.1.1 PROPERTIES OF THE REDUCTION (AMB) 166 4.1.2
THE STANDARDIZATION THEOREM 172 4.2 ANALYSIS OF Q-TERMS 174 4.2.1
IEN-LABELING OF REDUCTION SEQUENCES 176 4.2.2 PROPERTIES OF IE$R LABELED
EXPRESSIONS 179 4.2.3 EQUIVALENCE OF FI-TERMS 180 4.2.4 FI-TERMS ARE
LEAST W.R.T. LC 182 4.2.5 CORRECTNESS OF COPYING FI-TERMS 184 4.2.6
INHERITANCE OF MUST-DIVERGENCE W.R.T. OPERATORS . . 185 4.3 PROVING
CONTEXTUAL EQUIVALENCE BASED ON SUCCESSOR SETS 188 4.3.1 EXISTENCE OF
CONVERGENT AND DIVERGENT SUCCESSORS W.R.T XXVIII CONTENTS 4.5.2
ALGEBRAIC LAWS OF BOTTOM-AVOIDING CHOICE .... 215 4.5.3 CORRECTNESS OF
SEQ- AND AMB-ELIMINATION 221 4.5.4 CHARACTERISTIC LAWS OF THE PARALLEL
CONVERGENCE TESTER AND PARALLEL-OR AND DEMONIC CHOICE .... 234 5 A
CONCURRENT ABSTRACT MACHINE 241 5.1 THE CALCULUS A 1 ^ * 0 244 5.1.1 THE
SYNTAX 245 5.1.2 MACHINE ORDER REDUCTION 247 5.1.3 CONVERGENCE
EQUIVALENCE OF THE TRANSLATION T . . 252 5.1.4 CONTEXTUAL EQUIVALENCE
FOR A^ VAO 258 5.2 THE CONCURRENT ABSTRACT MACHINE CAM 262 5.2.1
DETERMINISTIC EVALUATION OF THREADS 262 5.2.2 ADDING CONCURRENCY USING
MORAN S APPROACH . . 266 5.2.3 FAILURE OF MORAN S APPROACH 267 5.2.4
ADDING CONCURRENCY USING PROCESS TREES 269 5.2.5 SAFE FINAHZATION OF
THREADS 271 5.2.6 ADDING FAIRNESS TO THE ABSTRACT MACHINE 276 5.2.7
MACHINE STATE CONVERGENCES 278 5.3 CORRECTNESS OF CAM 279 5.3.1 MACHINE
STATE CONTEXTS 279 5.3.2 SIMULATING MACHINE TRANSITIONS BY MACHINE OR-
DER REDUCTIONS 283 5.3.3 SIMULATING MACHINE ORDER REDUCTION ON THE CAM
285 5.3.3.1 THE UNWINDING TRANSITION 287 5.3.3.2 OVERLAPPINGS OF
UNWINDING TRANSITIONS . 290 5.3.3.3 SIMULATING MACHINE ORDER REDUCTIONS
EXCEP CONTENTS XXIX LIST OF ABBREVIATIONS AND NOTATIONS 321 BIBLIOGRAPHY
331 INDEX 351
|
| any_adam_object | 1 |
| author | Sabel, David 1977- |
| author_GND | (DE-588)136885403 |
| author_facet | Sabel, David 1977- |
| author_role | aut |
| author_sort | Sabel, David 1977- |
| author_variant | d s ds |
| building | Verbundindex |
| bvnumber | BV035276388 |
| classification_tum | DAT 544d DAT 557d |
| ctrlnum | (OCoLC)423749520 (DE-599)DNB992163102 |
| dewey-full | 005.131 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.131 |
| dewey-search | 005.131 |
| dewey-sort | 15.131 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 1. Aufl. |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02318nam a2200553 c 4500</leader><controlfield tag="001">BV035276388</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100219 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090128s2008 m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">992163102</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783899638660</subfield><subfield code="c">PB. : EUR 63.00</subfield><subfield code="9">978-3-89963-866-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783899638660</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)423749520</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB992163102</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 544d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 557d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sabel, David</subfield><subfield code="d">1977-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)136885403</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence</subfield><subfield code="c">David Sabel</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Aufl.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Dr. Hut Verlag</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXX, 358 S.</subfield><subfield code="c">210 mm x 148 mm, 505 gr.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Informatik</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Frankfurt am Main, Univ., Diss., 2008</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmtransformation - Korrektheit - Programmiersprache - Nebenläufigkeit - Abstrakter Automat - Lambda-Kalkül</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lambda-Kalkül</subfield><subfield code="0">(DE-588)4166495-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmtransformation</subfield><subfield code="0">(DE-588)4263654-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abstrakter Automat</subfield><subfield code="0">(DE-588)4141155-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmtransformation</subfield><subfield code="0">(DE-588)4263654-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Abstrakter Automat</subfield><subfield code="0">(DE-588)4141155-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Lambda-Kalkül</subfield><subfield code="0">(DE-588)4166495-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017081676&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017081676</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035276388 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:30:13Z |
| institution | BVB |
| isbn | 9783899638660 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017081676 |
| oclc_num | 423749520 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | XXX, 358 S. 210 mm x 148 mm, 505 gr. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Dr. Hut Verlag |
| record_format | marc |
| series2 | Informatik |
| spelling | Sabel, David 1977- Verfasser (DE-588)136885403 aut Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence David Sabel 1. Aufl. München Dr. Hut Verlag 2008 XXX, 358 S. 210 mm x 148 mm, 505 gr. txt rdacontent n rdamedia nc rdacarrier Informatik Zugl.: Frankfurt am Main, Univ., Diss., 2008 Programmtransformation - Korrektheit - Programmiersprache - Nebenläufigkeit - Abstrakter Automat - Lambda-Kalkül Lambda-Kalkül (DE-588)4166495-4 gnd rswk-swf Programmtransformation (DE-588)4263654-1 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Nebenläufigkeit (DE-588)4115352-2 gnd rswk-swf Korrektheit (DE-588)4240223-2 gnd rswk-swf Abstrakter Automat (DE-588)4141155-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Programmtransformation (DE-588)4263654-1 s Korrektheit (DE-588)4240223-2 s Programmiersprache (DE-588)4047409-4 s Nebenläufigkeit (DE-588)4115352-2 s Abstrakter Automat (DE-588)4141155-9 s Lambda-Kalkül (DE-588)4166495-4 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017081676&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sabel, David 1977- Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence Programmtransformation - Korrektheit - Programmiersprache - Nebenläufigkeit - Abstrakter Automat - Lambda-Kalkül Lambda-Kalkül (DE-588)4166495-4 gnd Programmtransformation (DE-588)4263654-1 gnd Programmiersprache (DE-588)4047409-4 gnd Nebenläufigkeit (DE-588)4115352-2 gnd Korrektheit (DE-588)4240223-2 gnd Abstrakter Automat (DE-588)4141155-9 gnd |
| subject_GND | (DE-588)4166495-4 (DE-588)4263654-1 (DE-588)4047409-4 (DE-588)4115352-2 (DE-588)4240223-2 (DE-588)4141155-9 (DE-588)4113937-9 |
| title | Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence |
| title_auth | Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence |
| title_exact_search | Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence |
| title_full | Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence David Sabel |
| title_fullStr | Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence David Sabel |
| title_full_unstemmed | Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence David Sabel |
| title_short | Semantics of a Call-by-Need Lambda Calculus with McCarthy amb for programm equivalence |
| title_sort | semantics of a call by need lambda calculus with mccarthy amb for programm equivalence |
| topic | Programmtransformation - Korrektheit - Programmiersprache - Nebenläufigkeit - Abstrakter Automat - Lambda-Kalkül Lambda-Kalkül (DE-588)4166495-4 gnd Programmtransformation (DE-588)4263654-1 gnd Programmiersprache (DE-588)4047409-4 gnd Nebenläufigkeit (DE-588)4115352-2 gnd Korrektheit (DE-588)4240223-2 gnd Abstrakter Automat (DE-588)4141155-9 gnd |
| topic_facet | Programmtransformation - Korrektheit - Programmiersprache - Nebenläufigkeit - Abstrakter Automat - Lambda-Kalkül Lambda-Kalkül Programmtransformation Programmiersprache Nebenläufigkeit Korrektheit Abstrakter Automat Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017081676&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT sabeldavid semanticsofacallbyneedlambdacalculuswithmccarthyambforprogrammequivalence |