Corpus ID: 23428723

A categorical programming language

@article{Hagino2020ACP,
  title={A categorical programming language},
  author={Tatsuya Hagino},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.05167}
}
  • T. Hagino
  • Published 11 October 2020
  • Computer Science
  • ArXiv
A theory of data types and a programming language based on category theory are presented. [...] Key Method Here, we use category theory. Category theory has proved to be remarkably good at revealing the nature of mathematical objects, and we use it to understand the true nature of data types in programming. We organize data types under a new categorical notion of F,G-dialgebras which is an extension of the notion of adjunctions as well as that of T -algebras. T -algebras are also used in domain theory, but…Expand
Categorical ML — Category-theoretic modular programming
We consider an extension of the functional programming language Standard ML with a modular structure based upon concepts in category theory such as categories, functors, natural transformations andExpand
Algebraic design language (preliminary definition)
This report constitutes a preliminary de nition of a new high level program ming language called ADL It uses the mathematical concept of structure algebras as its unit of modularity When algebras areExpand
An Algebra of Dependent Data Types
TLDR
Objective Caml is used to write functional programs where dependencies among data types (and in the relevant functions) are made explicit by a systematic mapping of layers of categorical constructions to layers of Objective Caml modules. Expand
Constructions, inductive types and strong normalization
TLDR
An extension of the core calculus by inductive types is investigated and it is shown how the realizability semantics and the strong normalization argument can be extended to non-algebraic inductive type types. Expand
Categorical programming with functorial strength
This work demonstrates industrial-strength categorical programs can be computed applicatively using only a category's commutative diagrams for reduction. Categorical initial and final datatypes canExpand
Parameters and Parametrization in Specification, Using Distributive Categories
  • B. Jacobs
  • Mathematics, Computer Science
  • Fundam. Informaticae
  • 1995
TLDR
It is shown that in the special case of Hagino specifications, these general definitions specialize to ones in terms of algebras or coalgebra for associated ‘strong’ polynomial functors. Expand
Inductive-Inductive Definitions
TLDR
A principle for introducing new types in type theory which generalises strictly positive indexed inductive data types and gives an axiomatisation of the new principle in such a way that the resulting type theory is consistent, which is proved by constructing a set-theoretic model. Expand
Structured recursion for non-uniform data-types
TLDR
This thesis shows how these recursion operators can be realized in the functional language Haskell, and presents a categorical semantics that supports formal reasoning about programs on non-uniform data-types. Expand
A Categorical Semantics for Inductive-Inductive Definitions
TLDR
This work extends the usual initial algebra semantics for ordinary inductive data types to the inductive-inductive setting by considering dialgebras instead of ordinary algebrs, which it is proved is equivalent to the usual formulation with elimination rules. Expand
ArticlesDialgebraic Logics: Extended Abstract
TLDR
It is demonstrated that in this way propositional logic and modal logic can be generated by a uniform constructions which differ only in the used type constructors of the corresponding syntactic categories. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 52 REFERENCES
Categorical Combinators, Sequential Algorithms, and Functional Programming
  • P. Curien
  • Computer Science
  • Progress in Theoretical Computer Science
  • 1993
TLDR
The new edition covers new results, and introduces new connections, as suggested by the following non-exhaustive fist of keywords: confluence properties of categorical combinators, explicit substitutions, control operations, linear logic, geometry of interaction, strong stability. Expand
The category-theoretic solution of recursive domain equations
  • M. Smyth, G. Plotkin
  • Mathematics, Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
The purpose of the present paper is to set up a categorical framework in which the known techniques for solving equations find a natural place, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories. Expand
ALGEBRAS, THEORIES AND FREENESS: AN INTRODUCTION FOR COMPUTER SCIENTISTS
In the last ten years or so a lot of algebraic ideas have wormed their way into Computer Science, particularly in work connected with correctness of compilers, with abstract data types and withExpand
Algebraic specification of data types: A synthetic approach
TLDR
The present work adds operations to the data types proposed by Scott and proposes an alternative to the equational specifications proposed by Guttag, Guttag and Horning and ADJ. Expand
Constructive mathematics and computer programming
If programming is understood not as the writing of instructions for this or that computing machine but as the design of methods of computation that it is the computer’s duty to execute (a differenceExpand
Data Types as Lattices
  • D. Scott
  • Computer Science
  • SIAM J. Comput.
  • 1976
A Kernel Language for Abstract Data Types and Modules
TLDR
This work uses typed lambda calculus with bindings, declarations, and types as first-class values to build modules, interfaces and implementations, abstract data types, generic types, recursive types, and unions in a concise operational semantics given by inference rules. Expand
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
TLDR
Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments. Expand
Introducing Institutions
TLDR
This paper shows how some parts of computer science can be done in any suitable logical system, by introducing the notion of an ins as a precise generalization of the informal notion of a mlogical system. Expand
∞-Categories for the Working Mathematician
homotopy theory C.1. Lifting properties, weak factorization systems, and Leibniz closure C.1.1. Lemma. Any class of maps characterized by a right lifting property is closed under composition,Expand
...
1
2
3
4
5
...