Typed Relational Conversion

被引：3
|
作者：
Lozov, Petr [1 ]
Vyatkin, Andrei [1 ]
Boulytchev, Dmitry [1 ,2 ]
机构：
[1] St Petersburg State Univ, Univ Ski Pr 28, St Petersburg 198504, Russia
[2] JetBrains Res, Univ Skaya Emb 7-9-11,Bldg 5A, St Petersburg 199034, Russia
来源：
TRENDS IN FUNCTIONAL PROGRAMMING (TFP 2017) | 2018年 / 10788卷
关键词：
D O I：
10.1007/978-3-319-89719-6_3
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We address the problem of transforming typed functional programs into relational form. In this form, a program can be run in various "directions" with some arguments left free, making it possible to acquire different behaviors from a single specification. We specify the syntax, typing rules and semantics for the source language as well as its relational extension, describe the conversion and prove its correctness both in terms of typing and dynamic semantics. We also discuss the limitations of our approach, present the implementation of the conversion for the subset of OCaml and evaluate it on a number of realistic examples.
引用
收藏
页码：39 / 58
页数：20
相关论文
共 50 条
  • [1] Typed Embedding of a Relational Language in OCaml
    Kosarev, Dmitrii
    Boulytchev, Dmitry
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (285): : 1 - 22
  • [2] TPROLOG - A TYPED PROLOG FOR RELATIONAL DATABASE-SYSTEMS
    ALAMOUDI, SMH
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 1992, 17 (03): : 415 - 422
  • [3] Typed Closure Conversion for the Calculus of Constructions
    Bowman, William J.
    Ahmed, Amal
    ACM SIGPLAN NOTICES, 2018, 53 (04) : 797 - 811
  • [4] Typed Closure Conversion for the Calculus of Constructions
    Bowman, William J.
    Ahmed, Amal
    PROCEEDINGS OF THE 39TH ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, PLDI 2018, 2018, : 797 - 811
  • [5] Weighted relational models of typed lambda-calculi
    Laird, Jim
    Manzonetto, Giulio
    McCusker, Guy
    Pagani, Michele
    2013 28TH ANNUAL IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2013, : 301 - 310
  • [6] Typed closure conversion preserves observational equivalence
    Ahmed, Amal
    Blume, Matthias
    ACM SIGPLAN NOTICES, 2008, 43 (09) : 157 - 168
  • [7] Typed Closure Conversion Preserves Observational Equivalence
    Ahmed, Amal
    Blume, Matthias
    ICFP'08: PROCEEDINGS OF THE 2008 SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, 2008, : 157 - 168
  • [8] Interleaving universal principles and relational constraints over typed feature logic
    Gotz, T
    Meurers, D
    35TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 8TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, 1997, : 1 - 8
  • [9] Flow-directed closure conversion for typed languages
    Cejtin, H
    Jagannathan, S
    Weeks, S
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2000, 1782 : 56 - 71
  • [10] Conversion of relational databases into ontologies
    Brünnhäußer, Jörg
    Konietzko, Erik Paul
    Zwicker, Florian
    ZWF Zeitschrift fuer Wirtschaftlichen Fabrikbetrieb, 2024, 119 (11): : 784 - 787
12345