Standard

Efficient fair conjunction for structurally-recursive relations. / Lozov, Peter; Boulytchev, Dmitry.

PEPM 2021 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2021. ed. / S Lindley; T Mogensen. Association for Computing Machinery, 2021. p. 58-73 (Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation).

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

Harvard

Lozov, P & Boulytchev, D 2021, Efficient fair conjunction for structurally-recursive relations. in S Lindley & T Mogensen (eds), PEPM 2021 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2021. Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Association for Computing Machinery, pp. 58-73, 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2021, co-located with the Annual Symposium on Principles of Programming Languages, POPL 2021, Virtual, Online, Denmark, 18/01/21. https://doi.org/10.1145/3441296.3441397

APA

Lozov, P., & Boulytchev, D. (2021). Efficient fair conjunction for structurally-recursive relations. In S. Lindley, & T. Mogensen (Eds.), PEPM 2021 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2021 (pp. 58-73). (Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation). Association for Computing Machinery. https://doi.org/10.1145/3441296.3441397

Vancouver

Lozov P, Boulytchev D. Efficient fair conjunction for structurally-recursive relations. In Lindley S, Mogensen T, editors, PEPM 2021 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2021. Association for Computing Machinery. 2021. p. 58-73. (Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation). https://doi.org/10.1145/3441296.3441397

Author

Lozov, Peter ; Boulytchev, Dmitry. / Efficient fair conjunction for structurally-recursive relations. PEPM 2021 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2021. editor / S Lindley ; T Mogensen. Association for Computing Machinery, 2021. pp. 58-73 (Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation).

BibTeX

@inproceedings{96f8cfe8b8d94854bdf04b18afc500f2,
title = "Efficient fair conjunction for structurally-recursive relations",
abstract = "We present a new, fair, conjunction evaluation strategy for relational programming language miniKanren. Unlike the original left-biased conjunction, our approach controls the order of conjunct execution based on the intrinsic properties of relation definitions. We present both the formal study of conjunction fairness and practical evaluation, which demonstrates the essential improvement in terms of both performance and convergence. ",
keywords = "evaluation strategies, miniKanren, operational semantics, relational programming",
author = "Peter Lozov and Dmitry Boulytchev",
note = "Funding Information: ∗The reported study was funded by RFBR, projects number 18-01-00380 and 19-31-90053. Publisher Copyright: {\textcopyright} 2021 ACM. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.; 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2021, co-located with the Annual Symposium on Principles of Programming Languages, POPL 2021 ; Conference date: 18-01-2021 Through 19-01-2021",
year = "2021",
month = jan,
day = "17",
doi = "10.1145/3441296.3441397",
language = "English",
series = "Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation",
publisher = "Association for Computing Machinery",
pages = "58--73",
editor = "S Lindley and T Mogensen",
booktitle = "PEPM 2021 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2021",
address = "United States",

}

RIS

TY - GEN

T1 - Efficient fair conjunction for structurally-recursive relations

AU - Lozov, Peter

AU - Boulytchev, Dmitry

N1 - Funding Information: ∗The reported study was funded by RFBR, projects number 18-01-00380 and 19-31-90053. Publisher Copyright: © 2021 ACM. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2021/1/17

Y1 - 2021/1/17

N2 - We present a new, fair, conjunction evaluation strategy for relational programming language miniKanren. Unlike the original left-biased conjunction, our approach controls the order of conjunct execution based on the intrinsic properties of relation definitions. We present both the formal study of conjunction fairness and practical evaluation, which demonstrates the essential improvement in terms of both performance and convergence.

AB - We present a new, fair, conjunction evaluation strategy for relational programming language miniKanren. Unlike the original left-biased conjunction, our approach controls the order of conjunct execution based on the intrinsic properties of relation definitions. We present both the formal study of conjunction fairness and practical evaluation, which demonstrates the essential improvement in terms of both performance and convergence.

KW - evaluation strategies

KW - miniKanren

KW - operational semantics

KW - relational programming

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

UR - https://www.mendeley.com/catalogue/945f7144-d431-310a-9aa5-79b67b91b161/

U2 - 10.1145/3441296.3441397

DO - 10.1145/3441296.3441397

M3 - Conference contribution

AN - SCOPUS:85099724569

T3 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

SP - 58

EP - 73

BT - PEPM 2021 - Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2021

A2 - Lindley, S

A2 - Mogensen, T

PB - Association for Computing Machinery

T2 - 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2021, co-located with the Annual Symposium on Principles of Programming Languages, POPL 2021

Y2 - 18 January 2021 through 19 January 2021

ER -

ID: 76606475