The Taming of the Rew: a Type Theory with Computational Assumptions Jesper Cockx, Nicolas Tabareau, Théo Winterhalter
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Linear Type Theory for Asynchronous Session Types
JFP 20 (1): 19–50, 2010. c Cambridge University Press 2009 19 ! doi:10.1017/S0956796809990268 First published online 8 December 2009 Linear type theory for asynchronous session types SIMON J. GAY Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK (e-mail: [email protected]) VASCO T. VASCONCELOS Departamento de Informatica,´ Faculdade de Ciencias,ˆ Universidade de Lisboa, 1749-016 Lisboa, Portugal (e-mail: [email protected]) Abstract Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system can be verified by static typechecking. Applications include network protocols, business processes and operating system services. In this paper we define a multithreaded functional language with session types, which unifies, simplifies and extends previous work. There are four main contributions. First is an operational semantics with buffered channels, instead of the synchronous communication of previous work. Second, we prove that the session type of a channel gives an upper bound on the necessary size of the buffer. Third, session types are manipulated by means of the standard structures of a linear type theory, rather than by means of new forms of typing judgement. Fourth, a notion of subtyping, including the standard subtyping relation for session types (imported into the functional setting), and a novel form of subtyping between standard and linear function types, which allows the typechecker to handle linear types conveniently. Our new approach significantly simplifies session types in the functional setting, clarifies their essential features and provides a secure foundation for language developments such as polymorphism and object-orientation. -
A General Framework for the Semantics of Type Theory
A General Framework for the Semantics of Type Theory Taichi Uemura November 14, 2019 Abstract We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin-L¨oftype theory, two-level type theory and cubical type theory. We establish basic results in the semantics of type theory: every type theory has a bi-initial model; every model of a type theory has its internal language; the category of theories over a type theory is bi-equivalent to a full sub-2-category of the 2-category of models of the type theory. 1 Introduction One of the key steps in the semantics of type theory and logic is to estab- lish a correspondence between theories and models. Every theory generates a model called its syntactic model, and every model has a theory called its internal language. Classical examples are: simply typed λ-calculi and cartesian closed categories (Lambek and Scott 1986); extensional Martin-L¨oftheories and locally cartesian closed categories (Seely 1984); first-order theories and hyperdoctrines (Seely 1983); higher-order theories and elementary toposes (Lambek and Scott 1986). Recently, homotopy type theory (The Univalent Foundations Program 2013) is expected to provide an internal language for what should be called \el- ementary (1; 1)-toposes". As a first step, Kapulkin and Szumio (2019) showed that there is an equivalence between dependent type theories with intensional identity types and finitely complete (1; 1)-categories. As there exist correspondences between theories and models for almost all arXiv:1904.04097v2 [math.CT] 13 Nov 2019 type theories and logics, it is natural to ask if one can define a general notion of a type theory or logic and establish correspondences between theories and models uniformly. -
Dependable Atomicity in Type Theory
Dependable Atomicity in Type Theory Andreas Nuyts1 and Dominique Devriese2 1 imec-DistriNet, KU Leuven, Belgium 2 Vrije Universiteit Brussel, Belgium Presheaf semantics [Hof97, HS97] are an excellent tool for modelling relational preservation prop- erties of (dependent) type theory. They have been applied to parametricity (which is about preservation of relations) [AGJ14], univalent type theory (which is about preservation of equiv- alences) [BCH14, Hub15], directed type theory (which is about preservation of morphisms) and even combinations thereof [RS17, CH19]. Of course, after going through the endeavour of con- structing a presheaf model of type theory, we want type-theoretic profit, i.e. we want internal operations that allow us to write cheap proofs of the `free' theorems [Wad89] that follow from the preservation property concerned. While the models for univalence, parametricity and directed type theory are all just cases of presheaf categories, approaches to internalize their results do not have an obvious common ances- tor (neither historically nor mathematically). Cohen et al. [CCHM16] have used the final type extension operator Glue to prove univalence. In previous work with Vezzosi [NVD17], we used Glue and its dual, the initial type extension operator Weld, to internalize parametricity to some extent. Before, Bernardy, Coquand and Moulin [BCM15, Mou16] have internalized parametricity using completely different `boundary filling’ operators Ψ (for extending types) and Φ (for extending func- tions). Unfortunately, Ψ and Φ have so far only been proven sound with respect to substructural (affine-like) variables of representable types (such as the relational or homotopy interval I). More 1 recently, Licata et al. [LOPS18] have exploited the fact that the homotopyp interval I is atomic | meaning that the exponential functor (I ! xy) has a right adjoint | in order to construct a universe of Kan-fibrant types from a vanilla Hofmann-Streicher universe [HS97] internally. -
Martin-Löf's Type Theory
Martin-L¨of’s Type Theory B. Nordstr¨om, K. Petersson and J. M. Smith 1 Contents 1 Introduction . 1 1.1 Different formulations of type theory . 3 1.2 Implementations . 4 2 Propositions as sets . 4 3 Semantics and formal rules . 7 3.1 Types . 7 3.2 Hypothetical judgements . 9 3.3 Function types . 12 3.4 The type Set .......................... 14 3.5 Definitions . 15 4 Propositional logic . 16 5 Set theory . 20 5.1 The set of Boolean values . 21 5.2 The empty set . 21 5.3 The set of natural numbers . 22 5.4 The set of functions (Cartesian product of a family of sets) 24 5.5 Propositional equality . 27 5.6 The set of lists . 29 5.7 Disjoint union of two sets . 29 5.8 Disjoint union of a family of sets . 30 5.9 The set of small sets . 31 6 ALF, an interactive editor for type theory . 33 1 Introduction The type theory described in this chapter has been developed by Martin-L¨of with the original aim of being a clarification of constructive mathematics. Unlike most other formalizations of mathematics, type theory is not based on predicate logic. Instead, the logical constants are interpreted within type 1This is a chapter from Handbook of Logic in Computer Science, Vol 5, Oxford University Press, October 2000 1 2 B. Nordstr¨om,K. Petersson and J. M. Smith theory through the Curry-Howard correspondence between propositions and sets [10, 22]: a proposition is interpreted as a set whose elements represent the proofs of the proposition. -
Personality Type Effects on Perceptions of Online Credit Card Payment Services Steven Walczak1 and Gary L
Journal of Theoretical and Applied Electronic Commerce Research This paper is available online at ISSN 0718–1876 Electronic Version www.jtaer.com VOL 11 / ISSUE 1 / JANUARY 2016 / 67-83 DOI: 10.4067/S0718-18762016000100005 © 2016 Universidad de Talca - Chile Personality Type Effects on Perceptions of Online Credit Card Payment Services Steven Walczak1 and Gary L. Borkan2 1 University of South Florida, School of Information, Tampa, FL, USA, [email protected] 2 Auraria Higher Education, Information Technology Department, Denver, CO, USA, [email protected] Received 22 September 2014; received in revised form 13 May 2015; accepted 18 May 2015 Abstract Credit cards and the subsequent payment of credit card debt play a crucial role in e-commerce transactions. While website design effects on trust and e-commerce have been studied, these are usually coarse grained models. A more individualized approach to utilization of online credit card payment services is examined that utilizes personality as measured by the Myers-Briggs personality type assessment to determine variances in perception of online payment service features. The results indicate that certain overriding principles appear to be largely universal, namely security and efficiency (or timeliness) of the payment system. However there are differences in the perceived benefit of these features and other features between personality types, which may be capitalized upon by payment service providers to attract a broader base of consumers and maintain continuance of existing users. Keywords: Credit-card, Electronic commerce, Myers-Briggs, Payment portals, Personality, Portal features 67 Personality Type Effects on Perceptions of Online Credit Card Payment Services Steven Walczak Gary L. -
Formalizing the Curry-Howard Correspondence
Formalizing the Curry-Howard Correspondence Juan F. Meleiro Hugo L. Mariano [email protected] [email protected] 2019 Abstract The Curry-Howard Correspondence has a long history, and still is a topic of active research. Though there are extensive investigations into the subject, there doesn’t seem to be a definitive formulation of this result in the level of generality that it deserves. In the current work, we intro- duce the formalism of p-institutions that could unify previous aproaches. We restate the tradicional correspondence between typed λ-calculi and propositional logics inside this formalism, and indicate possible directions in which it could foster new and more structured generalizations. Furthermore, we indicate part of a formalization of the subject in the programming-language Idris, as a demonstration of how such theorem- proving enviroments could serve mathematical research. Keywords. Curry-Howard Correspondence, p-Institutions, Proof The- ory. Contents 1 Some things to note 2 1.1 Whatwearetalkingabout ..................... 2 1.2 Notesonmethodology ........................ 4 1.3 Takeamap.............................. 4 arXiv:1912.10961v1 [math.LO] 23 Dec 2019 2 What is a logic? 5 2.1 Asfortheliterature ......................... 5 2.1.1 DeductiveSystems ...................... 7 2.2 Relations ............................... 8 2.2.1 p-institutions . 10 2.2.2 Deductive systems as p-institutions . 12 3 WhatistheCurry-HowardCorrespondence? 12 3.1 PropositionalLogic.......................... 12 3.2 λ-calculus ............................... 17 3.3 The traditional correspondece, revisited . 19 1 4 Future developments 23 4.1 Polarity ................................ 23 4.2 Universalformulation ........................ 24 4.3 Otherproofsystems ......................... 25 4.4 Otherconstructions ......................... 25 1 Some things to note This work is the conclusion of two years of research, the first of them informal, and the second regularly enrolled in the course MAT0148 Introdu¸c˜ao ao Trabalho Cient´ıfico. -
Proofs Are Programs: 19Th Century Logic and 21St Century Computing
Proofs are Programs: 19th Century Logic and 21st Century Computing Philip Wadler Avaya Labs June 2000, updated November 2000 As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as many twists and turns as a thriller. At the end of the story is a new principle for designing programming languages that will guide computers into the 21st century. For my money, Gentzen's natural deduction and Church's lambda calculus are on a par with Einstein's relativity and Dirac's quantum physics for elegance and insight. And the maths are a lot simpler. I want to show you the essence of these ideas. I'll need a few symbols, but not too many, and I'll explain as I go along. To simplify, I'll present the story as we understand it now, with some asides to fill in the history. First, I'll introduce Gentzen's natural deduction, a formalism for proofs. Next, I'll introduce Church's lambda calculus, a formalism for programs. Then I'll explain why proofs and programs are really the same thing, and how simplifying a proof corresponds to executing a program. -
Type Theory and Applications
Type Theory and Applications Harley Eades [email protected] 1 Introduction There are two major problems growing in two areas. The first is in Computer Science, in particular software engineering. Software is becoming more and more complex, and hence more susceptible to software defects. Software bugs have two critical repercussions: they cost companies lots of money and time to fix, and they have the potential to cause harm. The National Institute of Standards and Technology estimated that software errors cost the United State's economy approximately sixty billion dollars annually, while the Federal Bureau of Investigations estimated in a 2005 report that software bugs cost U.S. companies approximately sixty-seven billion a year [90, 108]. Software bugs have the potential to cause harm. In 2010 there were a approximately a hundred reports made to the National Highway Traffic Safety Administration of potential problems with the braking system of the 2010 Toyota Prius [17]. The problem was that the anti-lock braking system would experience a \short delay" when the brakes where pressed by the driver of the vehicle [106]. This actually caused some crashes. Toyota found that this short delay was the result of a software bug, and was able to repair the the vehicles using a software update [91]. Another incident where substantial harm was caused was in 2002 where two planes collided over Uberlingen¨ in Germany. A cargo plane operated by DHL collided with a passenger flight holding fifty-one passengers. Air-traffic control did not notice the intersecting traffic until less than a minute before the collision occurred. -
The Theory of Parametricity in Lambda Cube
数理解析研究所講究録 1217 巻 2001 年 143-157 143 The Theory of Parametricity in Lambda Cube Takeuti Izumi 竹内泉 Graduate School of Informatics, Kyoto Univ., 606-8501, JAPAN [email protected] 京都大学情報学研究科 Abstract. This paper defines the theories ofparametricity for all system of lambda cube, and shows its consistency. These theories are defined by the axiom sets in the formal theories. These theories prove various important semantical properties in the formal systems. Especially, the theory for asystem of lambda cube proves some kind of adjoint functor theorem internally. 1Introduction 1.1 Basic Motivation In the studies of informatics, it is important to construct new data types and find out the properties of such data types. For example, let $T$ and $T’$ be data types which is already known. Then we can construct anew data tyPe $T\mathrm{x}T'$ which is the direct product of $T$ and $T’$ . We have functions left, right and pair which satisfy the following equations: left(pair $xy$) $=x$ , right(pair $xy$) $=y$ for any $x:T$ and $y:T’$ , $T\mathrm{x}T'$ pair(left $z$ ) right $z$ ) $=z$ for any $z$ : . As for another example, we can construct Lit(T) which is atype of lists whose components are elements of $T$ . We have the empty list 0as the elements of List(T), the functions (-,-), which is so called sons-pair, and listrec. These element and functions satisfy the following equations: $listrec()fe=e$, listrec(s,l) $fe=fx(listrec lfe)$ for any $x:T$, $l$ :List(T), $e:D$ and $f$ : $Tarrow Darrow D$, where $D$ is another type. -
Combinatorial Species and Labelled Structures Brent Yorgey University of Pennsylvania, [email protected]
University of Pennsylvania ScholarlyCommons Publicly Accessible Penn Dissertations 1-1-2014 Combinatorial Species and Labelled Structures Brent Yorgey University of Pennsylvania, [email protected] Follow this and additional works at: http://repository.upenn.edu/edissertations Part of the Computer Sciences Commons, and the Mathematics Commons Recommended Citation Yorgey, Brent, "Combinatorial Species and Labelled Structures" (2014). Publicly Accessible Penn Dissertations. 1512. http://repository.upenn.edu/edissertations/1512 This paper is posted at ScholarlyCommons. http://repository.upenn.edu/edissertations/1512 For more information, please contact [email protected]. Combinatorial Species and Labelled Structures Abstract The theory of combinatorial species was developed in the 1980s as part of the mathematical subfield of enumerative combinatorics, unifying and putting on a firmer theoretical basis a collection of techniques centered around generating functions. The theory of algebraic data types was developed, around the same time, in functional programming languages such as Hope and Miranda, and is still used today in languages such as Haskell, the ML family, and Scala. Despite their disparate origins, the two theories have striking similarities. In particular, both constitute algebraic frameworks in which to construct structures of interest. Though the similarity has not gone unnoticed, a link between combinatorial species and algebraic data types has never been systematically explored. This dissertation lays the theoretical groundwork for a precise—and, hopefully, useful—bridge bewteen the two theories. One of the key contributions is to port the theory of species from a classical, untyped set theory to a constructive type theory. This porting process is nontrivial, and involves fundamental issues related to equality and finiteness; the recently developed homotopy type theory is put to good use formalizing these issues in a satisfactory way. -
John Hatcliff
John Hatcliff Curriculum Vitae April 2018 Professor Phone: (785) 532-6350 Department of Computing FAX: (785) 532-7353 and Information Sciences email: [email protected] Kansas State University WWW: http://people.cis.ksu.edu/~hatcliff Manhattan, KS 66506 USA Education Ph.D.: Computer Science, Kansas State University, Manhattan, Kansas, USA (1991-1994) M.Sc.: Computer Science, Queen's University, Kingston, Ontario, Canada (1989-1991) B.A.: Computer Science/Mathematics, Mount Vernon Nazarene College, Mount Vernon, Ohio, USA (1984-88) Interests Research Interests Safety- and security-critical systems, network-enabled medical devices and critical communication infrastructure, cyber-physical systems, risk management, regulatory policy for safety and security- critical systems, distributed system modeling and simulation, formal methods in software engineering, software verification, embedded systems, middleware, model-integrated computing, software architec- ture, static analyses of programs, concurrent and distributed systems, semantics of programming languages, logics and type theory. Teaching Interests Safety-critical systems, foundations of programming languages, software specification and verifica- tion, logic and set theory, construction of concurrent systems, compiler construction, formal language theory, software engineering, functional programming, logic programming. Employment 2011{present University Distinguished Professor, Department of Computing and Information Sci- ence, Kansas State University. 2005{2011: Professor, Department of Computing -
Polymorphism All the Way Up! from System F to the Calculus of Constructions
Programming = proving? The Curry-Howard correspondence today Second lecture Polymorphism all the way up! From System F to the Calculus of Constructions Xavier Leroy College` de France 2018-11-21 Curry-Howard in 1970 An isomorphism between simply-typed λ-calculus and intuitionistic logic that connects types and propositions; terms and proofs; reductions and cut elimination. This second lecture shows how: This correspondence extends to more expressive type systems and to more powerful logics. This correspondence inspired formal systems that are simultaneously a logic and a programming language (Martin-Lof¨ type theory, Calculus of Constructions, Pure Type Systems). 2 I Polymorphism and second-order logic Static typing vs. genericity Static typing with simple types (as in simply-typed λ-calculus but also as in Algol, Pascal, etc) sometimes forces us to duplicate code. Example A sorting algorithm applies to any list list(t) of elements of type t, provided it also receives then function t ! t ! bool that compares two elements of type t. With simple types, to sort lists of integers and lists of strings, we need two functions with dierent types, even if they implement the same algorithm: sort list int :(int ! int ! bool) ! list(int) ! list(int) sort list string :(string ! string ! bool) ! list(string) ! list(string) 4 Static typing vs. genericity There is a tension between static typing on the one hand and reusable implementations of generic algorithms on the other hand. Some languages elect to weaken static typing, e.g. by introducing a universal type “any” or “?” with run-time type checking, or even by turning typing o: void qsort(void * base, size_t nmemb, size_t size, int (*compar)(const void *, const void *)); Instead, polymorphic typing extends the algebra of types and the typing rules so as to give a precise type to a generic function.