{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":17,"n_cols":5,"rows_kept":17,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465848203316"]
[null,null,"Titolo",null,"Types for proofs and programs : International Workshop, TYPES '98, Kloster Irsee, Germany, March 27-31, 1998 : selected papers / / Thorsten Altenkirch, Wolfgang Naraschewski, Bernhard Reus, editors"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; Heidelberg : , : Springer, , [1999]"]
[{"$nulls":4},"Â©1999"]
[null,null,"ISBN",null,"3-540-48167-2"]
[null,null,"Edizione",null,"[1st ed. 1999.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 212 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science ; ; 1657"]
[null,null,"Disciplina",null,"004.015113"]
[null,null,"Soggetti",null,"Automatic theorem proving"]
[{"$nulls":4},"Type theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"On Relating Type Theories and Set Theories -- Communication Modelling and Context-Dependent Interpretation: An Integrated Approach -- Gröbner Bases in Type Theory -- A Modal Lambda Calculus with Iteration and Case Constructs -- Proof Normalization Modulo -- Proof of Imperative Programs in Type Theory -- An Interpretation of the Fan Theorem in Type Theory -- Conjunctive Types and SKInT -- Modular Structures as Dependent Types in Isabelle -- Metatheory of Verification Calculi in LEGO -- Bounded Polymorphism for Extensible Objects -- About Effective Quotients in Constructive Type Theory -- Algorithms for Equality and Unification in the Presence of Notational Definitions -- A Preview of the Basic Picture: A New Perspective on Formal Topology."]