Proceedings

Proceedings of the Fifth International Valentin Turchin Workshop on Metacomputation (PDF file)
 

Accepted Papers

Click on a paper title to get its PDF file.

• Working Notes: Compiling ULC to Lower-level Code by Game Semantics and Partial Evaluation (invited talk)
  Daniil Berezun and Neil D. Jones
  JetBrains and St. Petersburg State University, Russia
  University of Copenhagen, DIKU, Denmark
   
• Preliminary Report on Polynomial-Time Program Staging by Partial Evaluation
  Robert Glück
  University of Copenhagen, DIKU, Denmark
   
• Introduction to Valentin Turchin's Cybernetic Foundation of Mathematics
  Robert Glück and Andrei Klimov
  University of Copenhagen, DIKU, Denmark
  Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Russia
   
  
• Non-Linear Configurations for Superlinear Speedup by Supercompilation
  Robert Glück, Andrei Klimov, and Antonina Nepeivoda
  University of Copenhagen, DIKU, Denmark
  Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Russia
  Ailamazyan Program Systems Institute of Russian Academy of Sciences, Russia
   
  
• Towards Unification of Supercompilation and Equality Saturation
  Sergei Grechanik
  Keldysh Institute of Applied Mathematics of Russian Academy of Sciences, Russia
   
  
• On Programming and Biomolecular Computation (invited talk)
  Neil D. Jones
  University of Copenhagen, DIKU, Denmark
  See also https://www.youtube.com/watch?v=NXGxcziBnV4
   
  
• Distilling New Data Types
  Venkatesh Kannan and G.W. Hamilton
  Dublin City University, Republic of Ireland
   
  
• Enhanced PCB-Based Slicing
  Husni Khanfar and Björn Lisper
  Mälardalen University, Sweden
   
• Derivation of Parallel Programs of Recursive Doubling Type by Supercompilation with Neighborhood Embedding
  Arkady Klimov
  Institute for Design Problems in Microelectronics of Russian Academy of Sciences, Russia
   
  
• A Supercompiler Assisting Its Own Formal Verification
  Dimitur Krustev
  IGE+XAO Balkan, Bulgaria
   
  
• Simple Programs on Binary Trees – Testing and Decidable Equivalence
  Dimitur Krustev
  IGE+XAO Balkan, Bulgaria
   
  
• On a Method of Verification of Functional Programs
  Andrew Mironov
  Moscow State University, Russia
   
• Complexity of Turchin's Relation for Call-by-Name Computations (paper) (slides)
  Antonina Nepeivoda
  Ailamazyan Program Systems Institute of Russian Academy of Sciences, Russia
   
  
• Algorithm Design Patterns: Programming Theory Perspective
  Nikolay Shilov
  A.P. Ershov Institute of Informatics Systems of Russian Academy of Sciences, Russia
   

Additional Talks

These talks are mainly based on other publications and absent in the META 2016 proceedings.

• Language Support for Generic Programming in Object-Oriented Languages: Design Challenges
  Julia Belyakova
  Southern Federal University, Rostov-on-Don, Russia
  The talk is based on the publication in the Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering (SyRCOSE 2016), pp. 9-19. Here is the separate pdf file of the paper.
   
• On the Simulation of Two-Way Nondeterministic Pushdown Automata
  Robert Glück
  University of Copenhagen, DIKU, Denmark
   
• Ping-Pong Protocols as Prefix Grammars: Modeling and Verification via Program Transformation (slides)
  Antonina Nepeivoda
  Ailamazyan Program Systems Institute of Russian Academy of Sciences, Russia
  The talk is based on the publications in the Proceedings of the Second International Workshop on Verification and Program Transformation (VPT 2014) - see the page of the paper with the pdf file, and in Proceedings on Functional Programming Language Refal, Volume II, pp. 115-153 (in Russian)
   
• Turchin's Metasystems Transitions and "Constructive Set Theory" from the Viewpoint of Current State of Constructive Knowledge
  Nikolai Nepejvoda
  Ailamazyan Program Systems Institute of Russian Academy of Sciences, Russia