default search action
15th FLOPS 2020: Akita, Japan
- Keisuke Nakano, Konstantinos Sagonas:
Functional and Logic Programming - 15th International Symposium, FLOPS 2020, Akita, Japan, September 14-16, 2020, Proceedings. Lecture Notes in Computer Science 12073, Springer 2020, ISBN 978-3-030-59024-6
Invited Talk
- Makoto Hamana:
Theory and Practice of Second-Order Rewriting: Foundation, Evolution, and SOL. 3-9
Contributed Papers
- Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, Andrés Viso:
The Bang Calculus Revisited. 13-32 - Beniamino Accattoli, Alejandro Díaz-Caro:
Functional Pearl: The Distributive λ-Calculus. 33-49 - Emmanuel Hainry, Damiano Mazza, Romain Péchoux:
Polynomial Time over the Reals with Parsimony. 50-65 - Oleg Kiselyov, Keigo Imai:
Session Types Without Sophistry - System Description. 66-87 - Kenji Saotome, Koji Nakazawa, Daisuke Kimura:
Restriction on Cut in Cyclic Proof System for Symbolic Heaps. 88-105 - Matteo Cimini:
On the Effectiveness of Higher-Order Logic Programming in Language-Oriented Programming. 106-123 - Shin-Cheng Mu, Tsung-Ju Chiang:
Declarative Pearl: Deriving Monadic Quicksort. 124-138 - Rui Okura, Yukiyoshi Kameyama:
Language-Integrated Query with Nested Data Structures and Grouping. 139-158 - Kanae Tsushima, Bach Nguyen Trong, Robert Glück, Zhenjiang Hu:
An Efficient Composition of Bidirectional Programs by Memoization and Lazy Update. 159-178 - Oliver Westphal, Janis Voigtländer:
Implementing, and Keeping in Check, a DSL Used in E-Learning. 179-197 - Benjamin Mourad, Matteo Cimini:
System Description: Lang-n-Change - A Tool for Transforming Languages. 198-214 - Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
An SMT-Based Concolic Testing Tool for Logic Programs. 215-219
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.