DOCSLIB.ORG

Verified Programming of Turing Machines in Coq

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Verified Programming of Turing Machines in Coq Verified Programming of Turing Machines in Coq Yannick Forster Fabian Kunze Maximilian Wuttke Saarland University Saarland University Saarland University Saarbrücken, Germany Saarbrücken, Germany Saarbrücken, Germany [email protected] [email protected] [email protected] Abstract of their biggest disadvantages: When it comes to detailed We present a framework for the verified programming of or formal reasoning, Turing machines soon become very multi-tape Turing machines in Coq. Improving on prior work hard to treat. This is maybe best reflected by the fact that by Asperti and Ricciotti in Matita, we implement multiple while many basic areas of computer science, like logic, gram- layers of abstraction. The highest layer allows a user to im- mars, automata, or programming languages theory have plement nontrivial algorithms as Turing machines and verify been formalised in proof assistants, formalisations of even 1 their correctness, as well as time and space complexity com- basic complexity-theoretic results are not available. While positionally. The user can do so without ever mentioning constructing Turing machines on paper might be possible, states, symbols on tapes or transition functions: They write verifying a non-trivial machine defined in terms of states programs in an imperative language with registers contain- and transition functions in a proof assistant seems entirely ing values of encodable data types, and our framework con- infeasible. structs corresponding Turing machines. There were several attempts of formalising Turing ma- As case studies, we verify a translation from multi-tape to chines in proof assistants. Asperti and Ricciotti[2015] and single-tape machines as well as a universal Turing machine, Xu, Zhang, and Urban[2013] verify universal Turing ma- both with polynomial time overhead and constant factor chines in Matita and Isabelle/HOL, respectively, and Ciaffagli- space overhead. one[2016] formalises the undecidability of Turing machine halting in Coq. However, none of these results analyse time CCS Concepts • Theory of computation → Turing ma- or space complexity of their machines. chines; Type theory. The main difficulty for detailed reasoning about Turing Keywords Turing machines, verification, universal machine, machines is their lack of compositionality. For example, it is Coq not clear at all how to compose a two-tape Turing machine with a three-tape Turing machine that works on a different ACM Reference Format: alphabet. Therefore, it is common to rely on pseudo code or Yannick Forster, Fabian Kunze, and Maximilian Wuttke. 2020. Veri- prose describing the intended behaviour. The exact imple- fied Programming of Turing Machines in Coq. In Proceedings of mentation as well as its correctness or resource analysis is the 9th ACM SIGPLAN International Conference on Certified Pro- left as an exercise to the reader. In a mechanised proof, those grams and Proofs (CPP ’20), January 20–21, 2020, New Orleans, LA, USA. ACM, New York, NY, USA, 15 pages. https://doi.org/10.1145/ details cannot be left out. Luckily, it is possible to hide those 3372885.3373816 details behind suitable abstractions. We present a framework that aims to have the cake and 1 Introduction eat it too when it comes to mechanising computation in terms of Turing machines: Algorithms are stated in the style Turing machines are, at least on paper, the foundation of of a register based while-language; a corresponding Turing modern computability and complexity theory, in part due machine is automatically constructed behind the scene. Our to the conceptual simplicity of their definition. However, framework furthermore characterises the semantics by de- this simplicity leads to a lack of structure, which is also one riving two relations for each machine, one witnessing partial Permission to make digital or hard copies of all or part of this work for correctness, which can subsume a space-consumption analy- personal or classroom use is granted without fee provided that copies sis, and one witnessing termination, which can subsume a are not made or distributed for profit or commercial advantage and that running time analysis. These relations are similar to relations copies bear this notice and the full citation on the first page. Copyrights a Hoare-like logic would derive for the algorithm, especially for components of this work owned by others than the author(s) must in that they follow the internal structure of the program. The be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific only task left for the user is to simplify those synthesised permission and/or a fee. Request permissions from [email protected]. relations into a more high-level, hand-written description of CPP ’20, January 20–21, 2020, New Orleans, LA, USA the semantics. © 2020 Copyright held by the owner/author(s). Publication rights licensed to ACM. ACM ISBN 978-1-4503-7097-4/20/01...$15.00 1For example the Cook–Levin theorem (SAT is NP-complete), the inclusions https://doi.org/10.1145/3372885.3373816 % ⊆ NP ⊆ PSPACE ⊆ EXP, or the time and space hierarchy theorems. CPP ’20, January 20–21, 2020, New Orleans, LA, USA Yannick Forster, Fabian Kunze, and Maximilian Wuttke Our imperative abstractions for Turing machines are shal- the value of a tape that contains a number, or to copy the lowly embedded into Coq’s type theory: Primitive operations value from one tape to another tape. are predefined Turing machines performing primitive tasks. As case studies, we give a mechanisation of a translation Control-flow operators like If or While are Coq-functions from multi-tape to single-tape machines as well as a mechan- constructing new Turing machines from existing ones. isation of a universal Turing machine in Coq. Both machines To make reasoning and programming of Turing machines have a polynomial time and constant factor space overhead. feasible, we introduce three layers of abstractions, L1 - L3. To the best of our knowledge, this is the first formalised The lower layers are heavily inspired by the definitions As- universal machine verified w.r.t. time and space complexity perti and Ricciotti[2015] use to formalise multi-tape Turing for any model of computation in any proof assistant. machines in the proof assistant Matita. Definitions, lemmas, and theorems in the PDF-version of On the lowest layer L0 (which is actually not an abstrac- this document are hyperlinked with the accompanying Coq = " = 2 tion), we define -tape Turing machines : TMΣ over finite development ; those links are marked by a -symbol. alphabets Σ and their semantics in Coq, based on the defini- Structure Section2 introduces notation and type-theoretic tions by Asperti and Ricciotti. preliminaries. Sections3 to6 give an overview over the layers Layer L introduces labelled machines " : TM= ¹!º, which 1 Σ L - L . We report on the implementation of a translation additionally contain an arbitrary finite type ! together with a 0 3 from multi-tape to single-tape machines and a universal function labelling every state of the machine with an element machine in Sections7 and8. We conclude by commenting of this type. Labels can be seen as a partitioning of states, on the mechanised proofs (Section9), an overview of related abstracting away from implementation details. Based on work (Section 10), and a discussion of our results and future this notion we define two verification primitives: realisation work (Section 11). The appendix [Forster et al. 2019] contains (partial correctness) and termination. A labelled machine " = ! ' = ! = a full definition of Turing machines with all details. : TMΣ ¹ º realises a relation ⊆ TapeΣ × ¹ × TapeΣº, " ' written ⊨ , if for every terminating computation, the 2 Preliminaries input tapes are in relation with the label of the terminating state and the output tapes. Dually, a machine terminates in We work in constructive type theory with inductive types ) = " ) and an impredicative universe of propositions. a running time relation ⊆ TapeΣ × N, written # , if for every related pair of input tapes C and step counts :, the The basic inductive types we use are the Booleans B ::= 1 machine actually terminates in : steps on input C. Realisation true j false, the unit type ::= ¹º, the natural numbers = = - . and termination can be used to express the correctness of a N ::= 0 j S for : N, product types × , sum types - . = machine. ¸ , and the type with exactly elements F=. Given a - - G Programming machines on layer L is quite hard because type , we further define options O¹ º ::= ; j b c and lists 1 - G 퐴 G - 퐴 - we have to define concrete transition functions. We thus L¹ º ::= »¼ j :: for : and : L¹ º. These notations are shared with vectors G® : - = of fixed length = : N. We introduce layer L2 with primitive machines that can read, G - = 8 write and move the head as well as lifting operators and index elements of vectors ® : by indices : F= writing G 8 5 퐴 control-flow operators. ®» ¼. We write @ to map a function over a list, vector or Lifting operators and control-flow operators can be used tape. To inline case distinctions over inductive values inside formulas, we write match B with ? ) A j ... with patterns to compose machines. For example, given machines "1 : 1 1 = ! " < !0 ?1 and results A8 for pattern matching. TMΣ ¹ º and 2 : TMΓ ¹ º, we can use tape-lifting operators to obtain machines " 0 : TM=¸< ¹!º and " 0 : TM=¸< ¹!0º, and We encode relations as functions returning a proposition. 1 Σ 2 Γ _ =< . = < alphabet-liftings to obtain machines " 00 : TM=¸< ¹!º and Thus ¹ : Nº = defines the identity relation on 1 Σ¸Γ ' 퐴 퐵 " 00 : TM=¸< ¹!0º. We can then use control-flow operators to natural numbers. We write ⊆ × as an abbreviation 2 Σ¸Γ ' 퐴 퐵 ' ' compose them into a machine " 00; " 00 : TM=¸< ¹!0º.
Load more

Recommended publications
  • Type Safety of Rewrite Rules in Dependent Types
    Type safety of rewrite rules in dependent types Frédéric Blanqui Université Paris-Saclay, ENS Paris-Saclay, CNRS, Inria Laboratoire Spécification et Vérification, 94235, Cachan, France Abstract The expressiveness of dependent type theory can be extended by identifying types modulo some additional computation rules. But, for preserving the decidability of type-checking or the logical consistency of the system, one must make sure that those user-defined rewriting rules preserve typing. In this paper, we give a new method to check that property using Knuth-Bendix completion. 2012 ACM Subject Classification Theory of computation → Type theory; Theory of computation → Equational logic and rewriting; Theory of computation → Logic and verification Keywords and phrases subject-reduction, rewriting, dependent types Digital Object Identifier 10.4230/LIPIcs.FSCD.2020.11 Supplement Material https://github.com/wujuihsuan2016/lambdapi/tree/sr Acknowledgements The author thanks Jui-Hsuan Wu for his prototype implementation and his comments on a preliminary version of this work. 1 Introduction The λΠ-calculus, or LF [12], is an extension of the simply-typed λ-calculus with dependent types, that is, types that can depend on values like, for instance, the type V n of vectors of dimension n. And two dependent types like V n and V p are identified as soon as n and p are two expressions having the same value (modulo the evaluation rule of λ-calculus, β-reduction). In the λΠ-calculus modulo rewriting, function and type symbols can be defined not only by using β-reduction but also by using rewriting rules [19]. Hence, types are identified modulo β-reduction and some user-defined rewriting rules.
    [Show full text]
  • A Certified Study of a Reversible Programming Language
    A Certified Study of a Reversible Programming Language∗ Luca Paolini1, Mauro Piccolo2, and Luca Roversi3 1 Dipartimento di Informatica, Università degli Studi di Torino, corso Svizzera 185, 10149 Torino, Italy [email protected] 1 Dipartimento di Informatica, Università degli Studi di Torino, corso Svizzera 185, 10149 Torino, Italy [email protected] 1 Dipartimento di Informatica, Università degli Studi di Torino, corso Svizzera 185, 10149 Torino, Italy [email protected] Abstract We advance in the study of the semantics of Janus, a C-like reversible programming language. Our study makes utterly explicit some backward and forward evaluation symmetries. We want to deepen mathematical knowledge about the foundations and design principles of reversible computing and programming languages. We formalize a big-step operational semantics and a denotational semantics of Janus. We show a full abstraction result between the operational and denotational semantics. Last, we certify our results by means of the proof assistant Matita. 1998 ACM Subject Classification F.1.2 Computation by Abstract Devices: Modes of Compu- tation, F.3.2 Logics and Meanings of Programs: Semantics of Programming Languages Keywords and phrases reversible computing, Janus, operational semantics, bi-deterministic eval- uation, categorical semantics Digital Object Identifier 10.4230/LIPIcs.TYPES.2015.7 1 Introduction Reversible computing is an alternative form of computing: the isentropic core of classical computing [14] and quantum computing [21]. A classic computation is (forward-)deterministic,
    [Show full text]
  • Performance Engineering of Proof-Based Software Systems at Scale by Jason S
    Performance Engineering of Proof-Based Software Systems at Scale by Jason S. Gross B.S., Massachusetts Institute of Technology (2013) S.M., Massachusetts Institute of Technology (2015) Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY February 2021 © Massachusetts Institute of Technology 2021. All rights reserved. Author............................................................. Department of Electrical Engineering and Computer Science January 27, 2021 Certified by . Adam Chlipala Associate Professor of Electrical Engineering and Computer Science Thesis Supervisor Accepted by . Leslie A. Kolodziejski Professor of Electrical Engineering and Computer Science Chair, Department Committee on Graduate Students 2 Performance Engineering of Proof-Based Software Systems at Scale by Jason S. Gross Submitted to the Department of Electrical Engineering and Computer Science on January 27, 2021, in partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract Formal verification is increasingly valuable as our world comes to rely more onsoft- ware for critical infrastructure. A significant and understudied cost of developing mechanized proofs, especially at scale, is the computer performance of proof gen- eration. This dissertation aims to be a partial guide to identifying and resolving performance bottlenecks in dependently typed tactic-driven proof assistants like Coq. We present a survey of the landscape of performance issues in Coq, with micro- and macro-benchmarks. We describe various metrics that allow prediction of performance, such as term size, goal size, and number of binders, and note the occasional surprising lack of a bottleneck for some factors, such as total proof term size.
    [Show full text]
  • A Survey of Engineering of Formally Verified Software
    The version of record is available at: http://dx.doi.org/10.1561/2500000045 QED at Large: A Survey of Engineering of Formally Verified Software Talia Ringer Karl Palmskog University of Washington University of Texas at Austin [email protected] [email protected] Ilya Sergey Milos Gligoric Yale-NUS College University of Texas at Austin and [email protected] National University of Singapore [email protected] Zachary Tatlock University of Washington [email protected] arXiv:2003.06458v1 [cs.LO] 13 Mar 2020 Errata for the present version of this paper may be found online at https://proofengineering.org/qed_errata.html The version of record is available at: http://dx.doi.org/10.1561/2500000045 Contents 1 Introduction 103 1.1 Challenges at Scale . 104 1.2 Scope: Domain and Literature . 105 1.3 Overview . 106 1.4 Reading Guide . 106 2 Proof Engineering by Example 108 3 Why Proof Engineering Matters 111 3.1 Proof Engineering for Program Verification . 112 3.2 Proof Engineering for Other Domains . 117 3.3 Practical Impact . 124 4 Foundations and Trusted Bases 126 4.1 Proof Assistant Pre-History . 126 4.2 Proof Assistant Early History . 129 4.3 Proof Assistant Foundations . 130 4.4 Trusted Computing Bases of Proofs and Programs . 137 5 Between the Engineer and the Kernel: Languages and Automation 141 5.1 Styles of Automation . 142 5.2 Automation in Practice . 156 The version of record is available at: http://dx.doi.org/10.1561/2500000045 6 Proof Organization and Scalability 162 6.1 Property Specification and Encodings .
    [Show full text]
  • Analyzing Individual Proofs As the Basis of Interoperability Between Proof Systems
    Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems Gilles Dowek Inria and Ecole´ normale sup´erieure de Paris-Saclay, 61, avenue du Pr´esident Wilson, 94235 Cachan Cedex, France [email protected] We describe the first results of a project of analyzing in which theories formal proofs can be ex- pressed. We use this analysis as the basis of interoperability between proof systems. 1 Introduction Sciences study both individual objects and generic ones. For example, Astronomy studies both the individual planets of the Solar system: Mercury, Venus, etc. determining their radius, mass, composition, etc., but also the motion of generic planets: Kepler’s laws, that do not just apply to the six planets known at the time of Kepler, but also to those that have been discovered after, and those that may be discovered in the future. Computer science studies both algorithms that apply to generic data, but also specific pieces of data. Mathematics mostly studies generic objects, but sometimes also specific ones, such as the number π or the function ζ. Proof theory mostly studies generic proofs. For example, Gentzen’s cut elimination theorem for Predicate logic applies to any proof expressed in Predicate logic, those that were known at the time of Gentzen, those that have been constructed after, and those that will be constructed in the future. Much less effort is dedicated to studying the individual mathematical proofs, with a few exceptions, for example [29]. Considering the proofs that we have, instead of all those that we may build in some logic, sometimes changes the perspective.
    [Show full text]
  • Elaboration in Dependent Type Theory
    Elaboration in Dependent Type Theory Leonardo de Moura1, Jeremy Avigad*2, Soonho Kong3, and Cody Roux4 1 Microsoft Research, Redmond 2 Departments of Philosophy and Mathematical Sciences, Carnegie Mellon University 3 Department of Computer Science, Carnegie Mellon University 4 Draper Laboratories Abstract. We describe the elaboration algorithm that is used in Lean, a new interactive theorem prover based on dependent type theory. To be practical, interactive theorem provers must provide mechanisms to resolve ambiguities and infer implicit information, thereby supporting convenient input of expressions and proofs. Lean’s elaborator supports higher-order unification, ad-hoc overloading, insertion of coercions, type class inference, the use of tactics, and the computational reduction of terms. The interactions between these components are subtle and com- plex, and Lean’s elaborator has been carefully designed to balance effi- ciency and usability. 1 Introduction Just as programming languages run the spectrum from untyped languages like Lisp to strongly-typed functional programming languages like Haskell and ML, foundational systems for mathematics exhibit a range of diversity, from the untyped language of set theory to simple type theory and various versions of dependent type theory. Having a strongly typed language allows the user to convey the intent of an expression more compactly and efficiently, since a good deal of information can be inferred from type constraints. Moreover, a type dis- cipline catches routine errors quickly and flags them in informative ways. But this is a slippery slope: as we increasingly rely on types to serve our needs, the computational support that is needed to make sense of expressions in efficient and predictable ways becomes increasingly subtle and complex.
    [Show full text]
  • Programming and Proving with Classical Types
    Programming and proving with classical types Cristina Matache, Victor B. F. Gomes, and Dominic P. Mulligan Computer Laboratory, University of Cambridge Abstract The propositions-as-types correspondence is ordinarily presen- ted as linking the metatheory of typed λ-calculi and the proof theory of intuitionistic logic. Griffin observed that this correspondence could be extended to classical logic through the use of control operators. This observation set off a flurry of further research, leading to the development of Parigot's λµ-calculus. In this work, we use the λµ-calculus as the foundation for a system of proof terms for classical first-order logic. In particular, we define an extended call-by-value λµ-calculus with a type system in correspondence with full classical logic. We extend the language with polymorphic types, add a host of data types in `direct style', and prove several metatheoretical properties. All of our proofs and definitions are mechanised in Isabelle/HOL, and we automatically obtain an inter- preter for a system of proof terms cum programming language|called µML|using Isabelle's code generation mechanism. Atop our proof terms, we build a prototype LCF-style interactive theorem prover|called µTP| for classical first-order logic, capable of synthesising µML programs from completed tactic-driven proofs. We present example closed µML programs with classical tautologies for types, including some inexpressible as closed programs in the original λµ-calculus, and some example tactic-driven µTP proofs of classical tautologies. 1 Introduction Propositions are types; λ-terms encode derivations; β-reduction and proof norm- alisation coincide. These three points are the crux of the propositions-as-types correspondence|a product of mid-20th century mathematical logic|connecting the proof theory of intuitionistic propositional logic and the metatheory of the simply-typed λ-calculus.
    [Show full text]
  • Extending Nunchaku to Dependent Type Theory
    Extending Nunchaku to Dependent Type Theory Simon Cruanes Jasmin Christian Blanchette Inria Nancy – Grand Est, France Inria Nancy – Grand Est, France Max-Planck-Institut f¨ur Informatik, Saarbr¨ucken, Germany [email protected] [email protected] Nunchaku is a new higher-order counterexample generator based on a sequence of transformations from polymorphic higher-order logic to first-order logic. Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone tool, with frontends for various proof assistants. In this short paper, we present some ideas to extend Nunchaku with partial support for dependent types and type classes, to make frontends for Coq and other systems based on dependent type theory more useful. 1 Introduction In recent years, we have seen the emergence of “hammers”—integrations of automatic theorem provers in proof assistants, such as Sledgehammer and HOLyHammer [7]. As useful as they might be, these tools are mostly helpless in the face of an invalid conjecture. Novices and experts alike can enter invalid for- mulas and find themselves wasting hours (or days) on an impossible proof; once they identify and correct the error, the proof is often easy. To discover flaws early, some proof assistants include counterexample generators to debug putative theorems or specific subgoals in an interactive proof. When formalizing algebraic results in Isabelle/HOL, Guttmann et al. [21] remarked that Counterexample generators such as Nitpick complement the ATP [automatic theorem prov- ing] systems and allow a proof and refutation game which is useful for developing and debugging formal specifications. Nunchaku is a new fully automatic counterexample generator for higher-order logic (simple type theory) designed to be integrated into several proof assistants.
    [Show full text]
  • Coercive Subtyping: Theory and Implementation
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Open Archive Toulouse Archive Ouverte Open Archive TOULOUSE Archive Ouverte (OATAO) OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an author-deposited version published in : http://oatao.univ-toulouse.fr/ Eprints ID : 12725 To link to this article : DOI :10.1016/j.ic.2012.10.020 URL : http://dx.doi.org/10.1016/j.ic.2012.10.020 To cite this version : Luo, Zhaohui and Soloviev, Sergei and Xue, Tao Coercive subtyping: Theory and implementation. (2013) Information and Computation, vol. 223. pp. 18-42. ISSN 0890-5401 Any correspondance concerning this service should be sent to the repository administrator: [email protected] Coercive subtyping: Theory and implementation Z. Luo a,∗,1, S. Soloviev b, T. Xue a a Department of Computer Science, Royal Holloway, University of London, Surrey, UK b IRIT, 118 route de Narbonne, 31062 Toulouse cedex 4, France a b s t r a c t Coercive subtyping is a useful and powerful framework of subtyping for type theories. The key idea of coercive subtyping is subtyping as abbreviation. In this paper, we give a new and adequate formulation of T [C], the system that extends a type theory T with coercive subtyping based on a set C of basic subtyping judgements, and show that coercive subtyping is a conservative extension and, in a more general sense, a definitional extension. We introduce an intermediate system, the star-calculus T [C]∗, in which the positions that require coercion insertions are marked, and show that T [C]∗ is a conservative extension of T and that T [C]∗ is equivalent to T [C].
    [Show full text]
  • On Choice Rules in Dependent Type Theory
    On choice rules in dependent type theory Maria Emilia Maietti Dipartimento di Matematica, Universit`adi Padova (Italy) [email protected] Abstract. In a dependent type theory satisfying the propositions as types correspondence together with the proofs-as-programs paradigm, the validity of the unique choice rule or even more of the choice rule says that the extraction of a computable witness from an existential statement under hypothesis can be performed within the same theory. Here we show that the unique choice rule, and hence the choice rule, are not valid both in Coquand's Calculus of Constructions with indexed sum types, list types and binary disjoint sums and in its predicative version implemented in the intensional level of the Minimalist Founda- tion. This means that in these theories the extraction of computational witnesses from existential statements must be performed in a more ex- pressive proofs-as-programs theory. 1 Introduction Type theory is nowadays both a subfield of mathematical logic and of computer science. A perfect example of type theory studied both by mathematicians and by computer scientists is Martin-L¨of's type theory [21], for short ML. This is a dependent type theory which can be indeed considered both as a paradigm of a typed functional programming language and as a foundation of constructive mathematics. The reason is that, on one hand, types can be seen to represent data types and typed terms to represent programs. On the other hand, both sets and propositions can be represented as types and both elements of sets and proofs of propositions can be represented as typed terms.
    [Show full text]
  • User Interaction Widgets for Interactive Theorem Proving
    User Interaction Widgets for Interactive Theorem Proving Stefano Zacchiroli Technical Report UBLCS-2007-10 March 2007 Department of Computer Science University of Bologna Mura Anteo Zamboni 7 40127 Bologna (Italy) The University of Bologna Department of Computer Science Research Technical Re- ports are available in PDF and gzipped PostScript formats via anonymous FTP from the area ftp.cs.unibo.it:/pub/TR/UBLCS or via WWW at URL http://www.cs.unibo.it/. Plain-text abstracts organized by year are available in the directory ABSTRACTS. Recent Titles from the UBLCS Technical Report Series 2006-22 Broadcasting at the Critical Threshold, Arteconi, S., Hales, D., October 2006. 2006-23 Emergent Social Rationality in a Peer-to-Peer System, Marcozzi, A., Hales, D., October 2006. 2006-24 Reconstruction of the Protein Structures from Contact Maps, Margara, L., Vassura, M., di Lena, P., Medri, F., Fariselli, P., Casadio, R., October 2006. 2006-25 Lambda Types on the Lambda Calculus with Abbreviations, Guidi, F., November 2006. 2006-26 FirmNet: The Scope of Firms and the Allocation of Task in a Knowledge-Based Economy, Mollona, E., Marcozzi, A. November 2006. 2006-27 Behavioral Coalition Structure Generation, Rossi, G., November 2006. 2006-28 On the Solution of Cooperative Games, Rossi, G., December 2006. 2006-29 Motifs in Evolving Cooperative Networks Look Like Protein Structure Networks, Hales, D., Arteconi, S., December 2006. 2007-01 Extending the Choquet Integral, Rossi, G., January 2007. 2007-02 Towards Cooperative, Self-Organised Replica Management, Hales, D., Marcozzi, A., Cortese, G., February 2007. 2007-03 A Model and an Algebra for Semi-Structured and Full-Text Queries (PhD Thesis), Buratti, G., March 2007.
    [Show full text]
  • The Redprl Proof Assistant
    The RedPRL Proof Assistant Carlo Angiuli Evan Cavallo Kuen-Bang Hou (Favonia) Carnegie Mellon University Carnegie Mellon University Institute for Advanced Study [email protected] [email protected] [email protected] Robert Harper Jonathan Sterling Carnegie Mellon University Carnegie Mellon University [email protected] [email protected] RedPRL is an experimental proof assistant based on Cartesian cubical computational type theory, a new type theory for higher-dimensional constructions inspired by homotopy type theory. In the style of Nuprl, RedPRL users employ tactics to establish behavioral properties of cubical functional programs embodying the constructive content of proofs. Notably, RedPRL implements a two-level type theory, allowing an extensional, proof-irrelevant notion of exact equality to coexist with a higher- dimensional proof-relevant notion of paths. 1 Introduction Homotopy type theory [27] and Univalent Foundations [29] extend traditional type theory with a number of axioms inspired by homotopy-theoretic models [19], namely Voevodsky’s univalence axiom [28] and higher inductive types [21]. In recent years, these systems have been deployed as algebraic frameworks for formalizing results in synthetic homotopy theory [8,12,17], sometimes even leading to the discovery of novel generalizations of classical theorems [1]. The constructive character of type theory, embodied in the existence of canonical forms, is disrupted by axiomatic extensions that are not accounted for in the traditional computational semantics. Far from being merely a philosophical concern, the negation of type theory’s native algorithmic content impacts the practice of formalization. Brunerie proved that the 4th homotopy group of the 3-sphere is isomorphic to Z=nZ for some closed n, but establishing n = 2 required years of additional investigation [11].
    [Show full text]