Theorem proving in higher order logics: 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London
Springer
2000
|
| Schriftenreihe: | Lecture notes in computer science
1869 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | IX, 533 S. |
| ISBN: | 3540678638 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV013279582 | ||
| 003 | DE-604 | ||
| 005 | 20010402 | ||
| 007 | t| | ||
| 008 | 000725s2000 gw |||| 10||| eng d | ||
| 016 | 7 | |a 959389407 |2 DE-101 | |
| 020 | |a 3540678638 |9 3-540-67863-8 | ||
| 035 | |a (OCoLC)44713315 | ||
| 035 | |a (DE-599)BVBBV013279582 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-739 |a DE-384 |a DE-83 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA76.9.A96 | |
| 082 | 0 | |a 004/.01/5113 |2 21 | |
| 084 | |a DAT 005f |2 stub | ||
| 084 | |a DAT 706f |2 stub | ||
| 245 | 1 | 0 | |a Theorem proving in higher order logics |b 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings |c Mark Aagaard ; John Harrison (ed.) |
| 246 | 1 | 3 | |a TPHOLs 2000 |
| 264 | 1 | |a Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London |b Springer |c 2000 | |
| 300 | |a IX, 533 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1869 | |
| 500 | |a Literaturangaben | ||
| 650 | 7 | |a Automatische bewijsvoering |2 gtt | |
| 650 | 7 | |a COQ |2 inriac | |
| 650 | 7 | |a HOL |2 inriac | |
| 650 | 7 | |a Inteligencia artificial (computacao) |2 larpcal | |
| 650 | 7 | |a Logica matematica |2 larpcal | |
| 650 | 7 | |a Logica |2 gtt | |
| 650 | 4 | |a Théorèmes - Démonstration automatique - Congrès | |
| 650 | 7 | |a Théorèmes - Démonstration automatique - Congrès |2 ram | |
| 650 | 7 | |a déduction automatique |2 inriac | |
| 650 | 7 | |a démonstration théorème |2 inriac | |
| 650 | 7 | |a logique mathématique |2 inriac | |
| 650 | 7 | |a logique ordre élevé |2 inriac | |
| 650 | 7 | |a méthode formelle |2 inriac | |
| 650 | 7 | |a vérification |2 inriac | |
| 650 | 4 | |a Logik | |
| 650 | 4 | |a Automatic theorem proving |v Congresses | |
| 650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a HOL |0 (DE-588)4335765-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2000 |z Portland Or. |2 gnd-content | |
| 689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a HOL |0 (DE-588)4335765-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Aagaard, Mark |d 1966- |e Sonstige |0 (DE-588)12218839X |4 oth | |
| 711 | 2 | |a TPHOLs |n 13 |d 2000 |c Portland, Or. |j Sonstige |0 (DE-588)10005672-6 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1869 |w (DE-604)BV000000607 |9 1869 | |
| 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=009054069&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009054069 | |
Datensatz im Suchindex
| _version_ | 1820874893543079936 |
|---|---|
| adam_text |
CONTENTS
FIX-POINT
EQUATIONS
FOR
WELL-FOUNDED
RECURSION
IN
TYPE
THEORY
ANTONIA
BALAA
AND
YVES
BERTOT
.1
PROGRAMMING
AND
COMPUTING
IN
HOL
BRUNO
BARRAS
.1
7
PROOF
TERMS
FOR
SIMPLY
TYPED
HIGHER
ORDER
LOGIC
STEFAN
BERGHOFER
AND
TOBIAS
NIPKOW
.3
8
ROUTING
INFORMATION
PROTOCOL
IN
HOL/SPIN
KARTHIKEYAN
BHARGAVAN,
CARL
A.
GUNTER
AND
DAVOR
OBRADOVIC
.5
3
RECURSIVE
FAMILIES
OF
INDUCTIVE
TYPES
VENANZIO
CAPRETTA
.7
3
AIRCRAFT
TRAJECTORY
MODELING
AND
ALERTING
ALGORITHM
VERIYYCATION
VYYYYCTOR
CARRE~NO
AND
CYYESAR
MU~NOZ
.9
0
INTEL'S
FORMAL
VERIYYCATION
EXPERIENCE
ON
THE
WILLAMETTE
DEVELOPMENT
(INVITED
TALK)
BOB
COLWELL
AND
BOB
BRENNAN
.1
0
6
A
PROTOTYPE
PROOF
TRANSLATOR
FROM
HOL
TO
COQ
EWEN
DENNEY
.1
0
8
PROVING
ML
TYPE
SOUNDNESS
WITHIN
COQ
CATHERINE
DUBOIS
.1
2
6
ON
THE
MECHANIZATION
OF
REAL
ANALYSIS
IN
ISABELLE/HOL
JACQUES
D.
FLEURIOT
.1
4
5
EQUATIONAL
REASONING
VIA
PARTIAL
REFLECTION
H.
GEUVERS,
F.
WIEDIJK
AND
J.
ZWANENBURG
.1
6
2
REACHABILITY
PROGRAMMING
IN
HOL98
USING
BDDS
MICHAEL
J.
C.
GORDON
.1
7
9
TRANSCENDENTAL
FUNCTIONS
AND
CONTINUITY
CHECKING
IN
PVS
HANNE
GOTTLIEBSEN
.1
9
7
VIII
CONTENTS
VERIYYED
OPTIMIZATIONS
FOR
THE
INTEL
IA-64
ARCHITECTURE
JIM
GRUNDY
.2
1
5
FORMAL
VERIYYCATION
OF
IA-64
DIVISION
ALGORITHMS
JOHN
HARRISON
.2
3
3
FAST
TACTIC-BASED
THEOREM
PROVING
JASON
HICKEY
AND
ALEKSEY
NOGIN
.2
5
2
IMPLEMENTING
A
PROGRAM
LOGIC
OF
OBJECTS
IN
A
HIGHER-ORDER
LOGIC
THEOREM
PROVER
MARTIN
HOFMANN
AND
FRANCIS
TANG
.2
6
8
A
STRONG
AND
MECHANIZABLE
GRAND
LOGIC
M.
RANDALL
HOLMES
.2
8
3
INHERITANCE
IN
HIGHER
ORDER
LOGIC:
MODELING
AND
REASONING
MARIEKE
HUISMAN
AND
BART
JACOBS
.3
0
1
TOTAL-CORRECTNESS
REYYNEMENT
FOR
SEQUENTIAL
REACTIVE
SYSTEMS
PAUL
B.
JACKSON
.3
2
0
DIVIDER
CIRCUIT
VERIYYCATION
WITH
MODEL
CHECKING
AND
THEOREM
PROVING
ROOPE
KAIVOLA
AND
MARK
D.
AAGAARD
.3
3
8
SPECIYYCATION
AND
VERIYYCATION
OF
A
STEAM-BOILER
WITH
SIGNAL-COQ
MICKA¨EL
KERBYYUF,
DAVID
NOWAK
AND
JEAN-PIERRE
TALPIN
.3
5
6
FUNCTIONAL
PROCEDURES
IN
HIGHER-ORDER
LOGIC
LINAS
LAIBINIS
AND
JOAKIM
VON
WRIGHT
.3
7
2
FORMALIZING
STYYALMARCK'S
ALGORITHM
IN
COQ
PIERRE
LETOUZEY
AND
LAURENT
THYYERY
.3
8
8
TAS
|
A
GENERIC
WINDOW
INFERENCE
SYSTEM
CHRISTOPH
L¨UTH
AND
BURKHART
WOLYY
.4
0
6
WEAK
ALTERNATING
AUTOMATA
IN
ISABELLE/HOL
STEPHAN
MERZ
.4
2
4
GRAPHICAL
THEORIES
OF
INTERACTIVE
SYSTEMS:
CAN
A
PROOF
ASSISTANT
HELP?
(INVITED
TALK)
ROBIN
MILNER
.4
4
2
CONTENTS
IX
FORMAL
VERIYYCATION
OF
THE
ALPHA
21364
NETWORK
PROTOCOL
ABDEL
MOKKEDEM
AND
TIM
LEONARD
.4
4
3
DEPENDENTLY
TYPED
RECORDS
FOR
REPRESENTING
MATHEMATICAL
STRUCTURE
ROBERT
POLLACK
.4
6
2
TOWARDS
A
MACHINE-CHECKED
JAVA
SPECIYYCATION
BOOK
BERNHARD
REUS
AND
TATJANA
HEIN
.4
8
0
ANOTHER
LOOK
AT
NESTED
RECURSION
KONRAD
SLIND
.4
9
8
AUTOMATING
THE
SEARCH
FOR
ANSWERS
TO
OPEN
QUESTIONS
(INVITED
TALK)
LARRY
WOS
AND
BRANDEN
FITELSON
.5
1
9
APPENDIX:
CONJECTURES
CONCERNING
PROOF,
DESIGN,
AND
VERIYYCATION
LARRY
WOS
.5
2
6
AUTHOR
INDEX
.5
3
5 |
| any_adam_object | 1 |
| author_GND | (DE-588)12218839X |
| building | Verbundindex |
| bvnumber | BV013279582 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A96 |
| callnumber-search | QA76.9.A96 |
| callnumber-sort | QA 276.9 A96 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 005f DAT 706f |
| ctrlnum | (OCoLC)44713315 (DE-599)BVBBV013279582 |
| dewey-full | 004/.01/5113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.01/5113 |
| dewey-search | 004/.01/5113 |
| dewey-sort | 14 11 45113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV013279582</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010402</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">000725s2000 gw |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">959389407</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540678638</subfield><subfield code="9">3-540-67863-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)44713315</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013279582</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">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A96</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.01/5113</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 005f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theorem proving in higher order logics</subfield><subfield code="b">13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings</subfield><subfield code="c">Mark Aagaard ; John Harrison (ed.)</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">TPHOLs 2000</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 533 S.</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="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1869</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automatische bewijsvoering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COQ</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">HOL</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Inteligencia artificial (computacao)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logica matematica</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorèmes - Démonstration automatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Théorèmes - Démonstration automatique - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">déduction automatique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">démonstration théorème</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique mathématique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique ordre élevé</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">méthode formelle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">vérification</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">HOL</subfield><subfield code="0">(DE-588)4335765-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)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2000</subfield><subfield code="z">Portland Or.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">HOL</subfield><subfield code="0">(DE-588)4335765-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Aagaard, Mark</subfield><subfield code="d">1966-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)12218839X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">TPHOLs</subfield><subfield code="n">13</subfield><subfield code="d">2000</subfield><subfield code="c">Portland, Or.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10005672-6</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1869</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1869</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=009054069&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009054069</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2000 Portland Or. gnd-content |
| genre_facet | Konferenzschrift 2000 Portland Or. |
| id | DE-604.BV013279582 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:06:57Z |
| institution | BVB |
| institution_GND | (DE-588)10005672-6 |
| isbn | 3540678638 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009054069 |
| oclc_num | 44713315 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-739 DE-384 DE-83 DE-188 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-739 DE-384 DE-83 DE-188 DE-706 |
| physical | IX, 533 S. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings Mark Aagaard ; John Harrison (ed.) TPHOLs 2000 Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London Springer 2000 IX, 533 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1869 Literaturangaben Automatische bewijsvoering gtt COQ inriac HOL inriac Inteligencia artificial (computacao) larpcal Logica matematica larpcal Logica gtt Théorèmes - Démonstration automatique - Congrès Théorèmes - Démonstration automatique - Congrès ram déduction automatique inriac démonstration théorème inriac logique mathématique inriac logique ordre élevé inriac méthode formelle inriac vérification inriac Logik Automatic theorem proving Congresses Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf HOL (DE-588)4335765-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2000 Portland Or. gnd-content Automatisches Beweisverfahren (DE-588)4069034-9 s DE-604 HOL (DE-588)4335765-9 s Aagaard, Mark 1966- Sonstige (DE-588)12218839X oth TPHOLs 13 2000 Portland, Or. Sonstige (DE-588)10005672-6 oth Lecture notes in computer science 1869 (DE-604)BV000000607 1869 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009054069&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings Lecture notes in computer science Automatische bewijsvoering gtt COQ inriac HOL inriac Inteligencia artificial (computacao) larpcal Logica matematica larpcal Logica gtt Théorèmes - Démonstration automatique - Congrès Théorèmes - Démonstration automatique - Congrès ram déduction automatique inriac démonstration théorème inriac logique mathématique inriac logique ordre élevé inriac méthode formelle inriac vérification inriac Logik Automatic theorem proving Congresses Automatisches Beweisverfahren (DE-588)4069034-9 gnd HOL (DE-588)4335765-9 gnd |
| subject_GND | (DE-588)4069034-9 (DE-588)4335765-9 (DE-588)1071861417 |
| title | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings |
| title_alt | TPHOLs 2000 |
| title_auth | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings |
| title_exact_search | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings |
| title_full | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings Mark Aagaard ; John Harrison (ed.) |
| title_fullStr | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings Mark Aagaard ; John Harrison (ed.) |
| title_full_unstemmed | Theorem proving in higher order logics 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings Mark Aagaard ; John Harrison (ed.) |
| title_short | Theorem proving in higher order logics |
| title_sort | theorem proving in higher order logics 13th international conference tphols 2000 portland or usa august 14 18 2000 proceedings |
| title_sub | 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14 - 18, 2000 ; proceedings |
| topic | Automatische bewijsvoering gtt COQ inriac HOL inriac Inteligencia artificial (computacao) larpcal Logica matematica larpcal Logica gtt Théorèmes - Démonstration automatique - Congrès Théorèmes - Démonstration automatique - Congrès ram déduction automatique inriac démonstration théorème inriac logique mathématique inriac logique ordre élevé inriac méthode formelle inriac vérification inriac Logik Automatic theorem proving Congresses Automatisches Beweisverfahren (DE-588)4069034-9 gnd HOL (DE-588)4335765-9 gnd |
| topic_facet | Automatische bewijsvoering COQ HOL Inteligencia artificial (computacao) Logica matematica Logica Théorèmes - Démonstration automatique - Congrès déduction automatique démonstration théorème logique mathématique logique ordre élevé méthode formelle vérification Logik Automatic theorem proving Congresses Automatisches Beweisverfahren Konferenzschrift 2000 Portland Or. |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009054069&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT aagaardmark theoremprovinginhigherorderlogics13thinternationalconferencetphols2000portlandorusaaugust14182000proceedings AT tpholsportlandor theoremprovinginhigherorderlogics13thinternationalconferencetphols2000portlandorusaaugust14182000proceedings AT aagaardmark tphols2000 AT tpholsportlandor tphols2000 |