Standard

Typed Relational Conversion. / Lozov, Petr ; Vyatkin, Andrei ; Boulytchev, Dmitry .

Trends in Functional Programming: 18th International Symposium, TFP 2017, Canterbury, UK, June 19-21, 2017, Revised Selected Papers. Springer Nature, 2018. p. 39-58 (Lecture Notes in Computer Science; Vol. 10788).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Lozov, P, Vyatkin, A & Boulytchev, D 2018, Typed Relational Conversion. in Trends in Functional Programming: 18th International Symposium, TFP 2017, Canterbury, UK, June 19-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10788, Springer Nature, pp. 39-58, Trends in Functional Programming, Canterbury, United Kingdom, 19/06/17. https://doi.org/10.1007/978-3-319-89719-6_3

APA

Lozov, P., Vyatkin, A., & Boulytchev, D. (2018). Typed Relational Conversion. In Trends in Functional Programming: 18th International Symposium, TFP 2017, Canterbury, UK, June 19-21, 2017, Revised Selected Papers (pp. 39-58). (Lecture Notes in Computer Science; Vol. 10788). Springer Nature. https://doi.org/10.1007/978-3-319-89719-6_3

Vancouver

Lozov P, Vyatkin A, Boulytchev D. Typed Relational Conversion. In Trends in Functional Programming: 18th International Symposium, TFP 2017, Canterbury, UK, June 19-21, 2017, Revised Selected Papers. Springer Nature. 2018. p. 39-58. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-89719-6_3

Author

Lozov, Petr ; Vyatkin, Andrei ; Boulytchev, Dmitry . / Typed Relational Conversion. Trends in Functional Programming: 18th International Symposium, TFP 2017, Canterbury, UK, June 19-21, 2017, Revised Selected Papers. Springer Nature, 2018. pp. 39-58 (Lecture Notes in Computer Science).

BibTeX

@inproceedings{49777ec7c5b3465683ff2371b8fcfa34,
title = "Typed Relational Conversion",
abstract = "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.",
keywords = "Relative Conversion, Relative Extension, Typing Rules, Hindley-Milner Type System, Disequality Constraints",
author = "Petr Lozov and Andrei Vyatkin and Dmitry Boulytchev",
note = "Lozov P., Vyatkin A., Boulytchev D. (2018) Typed Relational Conversion. In: Wang M., Owens S. (eds) Trends in Functional Programming. TFP 2017. Lecture Notes in Computer Science, vol 10788. Springer, Cham. https://doi.org/10.1007/978-3-319-89719-6_3; Trends in Functional Programming : 18th International Symposium, TFP 2017 ; Conference date: 19-06-2017 Through 21-06-2017",
year = "2018",
month = apr,
day = "19",
doi = "10.1007/978-3-319-89719-6_3",
language = "English",
isbn = "978-3-319-89718-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer Nature",
pages = "39--58",
booktitle = "Trends in Functional Programming",
address = "Germany",

}

RIS

TY - GEN

T1 - Typed Relational Conversion

AU - Lozov, Petr

AU - Vyatkin, Andrei

AU - Boulytchev, Dmitry

N1 - Lozov P., Vyatkin A., Boulytchev D. (2018) Typed Relational Conversion. In: Wang M., Owens S. (eds) Trends in Functional Programming. TFP 2017. Lecture Notes in Computer Science, vol 10788. Springer, Cham. https://doi.org/10.1007/978-3-319-89719-6_3

PY - 2018/4/19

Y1 - 2018/4/19

N2 - 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.

AB - 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.

KW - Relative Conversion

KW - Relative Extension

KW - Typing Rules

KW - Hindley-Milner Type System

KW - Disequality Constraints

UR - http://www.scopus.com/inward/record.url?scp=85045972905&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-89719-6_3

DO - 10.1007/978-3-319-89719-6_3

M3 - Conference contribution

SN - 978-3-319-89718-9

T3 - Lecture Notes in Computer Science

SP - 39

EP - 58

BT - Trends in Functional Programming

PB - Springer Nature

T2 - Trends in Functional Programming

Y2 - 19 June 2017 through 21 June 2017

ER -

ID: 71303993