Supplementary materials:

Paul Laforgue, Yann Régis-Gianas. Copattern matching and first-class observations in OCaml, with a macro // PPDP-17.

Presenter: Dmitry Kosarev

Date: February 19, 2018

Time: 17:15

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

]]>Supplementary materials:

1. U. Berger, H. Schwichtenberg. An inverse to the evaluation functional for typed λ-calculus.

2. T. Altenkirch and T. Uustalu. Normalization by evaluation for λ→2.

3. U. Berger, M. Eberl, H. Schwichtenberg. Term rewriting for normalization by evaluation.

Presenter: Daniil Berezun

Date: February 12, 2018

Time: 17:15

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

]]>Presenter --- Sergey Bozhko

Date: December 11, 2017

Time: 17:15

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

]]>Supplementary materials:

Philip Wadler. Theorems for free!

Presenter: Dmitri Rozplokhas

Date: December 4, 2017

Time: 17:15

Presenter --- Eugene Moiseenko

Date: November 27, 2017

Time: 17:15

The talk is based on the paper (in Russian).

The full version of the proof is available here(in Russian).

Presenter --- Anton Podkopaev

Date: November 20, 2017

Time: 17:15

In the talk we will discuss

- the features, which a well-designed code generator should have;

- an intermediate approach for code generation, used in OCaml compiler, which lies in between the naive one and that used in the "visitors" library;

- implementation details of the "visitors" library.

Supplementary materials:

1. Manual

2. ICFP-2017 talk (from 22-th minute)

3. Francois Pottier. Visitors Unchained. ICFP 2017

Presenter --- Dmitry Kosarev.

Date: November 13, 2017

Time: 17:15

Supplementary materials:

Matt Might, David Darais, Daniel Spiewak. Parsing with Derivatives.

Presenter: Danila Borovkov

Date: October 30, 2017

Time: 17:15

Supplementary materials:

Morten Heine B. Sorensen, Robert Gluck. Introduction to Supercompilation

Илья Ключников. Суперкомпиляция: идеи и методы

Presenter: Ekaterina Verbitskaya

Date: October 9, 2017

Time: 17:15

Supplementary materials:

Daniel Norbert Gotzmann. Multiple Context-Free Grammars

Presenter: Semyon Grigoriev

Date: October 16, 2017

Time: 17:15

Supplementary materials:

Matija Pretnar. An Introduction to Algebraic Effects and Handlers.

Andrej Bauer, Matija Pretnar. Programming with Algebraic Effects and Handlersand Handlers.

Presenter: Dmitry Boulytchev

Date: October 2, 2017

Time: 17:15

Supplementary materials: https://github.com/YaccConstructor/articles/blob/master/InProgress/EDBT/graphparsing.pdf

Presenter: Rustam Azimov

Date: September 25, 2017

Time: 17:15

The article has been published in the Proceedings of the Genetic and Evolutionary Computation Conference Companion and has recently been indexed in Scopus.

]]>Title of the paper: **Block cipher based on modular arithmetic and methods of information compression** (authors Sergey Krendelev, Dmitry Shishlyannikov, Nikita Zbitnev, Dmitry Gridin.

Sergey's co-authors presented the paper on the conference's scientific seminar, during which scientists, graduate students and students, working on creating new approaches to semantic analysis, machine learning and structuring, processing and visualization of large volumes of data, presented their works that had passed the competitive selection .

The paper is expected to be published in the Journal of Physics: Conference Series (JPCS).

An interview with the students is published online at:

]]>He presented the paper "**Key Exchange Algorithm Based on Homomorphic Encryption**" (authors Sergey Krendelev, Ilya Kuzmin).

The relevance of the work is justified by the fact that the widely used Diffie-Hellman algorithm, which is based on the problem of discrete logarithm, becomes vulnerable when a sufficiently powerful quantum computer appears (see Shor's Algorithm). The stability of the proposed algorithm is based on the problem of finding the root of a system of linear equations with the number of equations known to be less than the number of variables. This problem seems algorithmically complex, as well as stable before quantum computers.

The paper is expected to be published in the IEEE.

]]>Supplementary materials: http://goto.ucsd.edu/~rjhala/liquid/liquid_types.p...

Presenter: Evgeny Moiseenko

Date: September 18, 2017

Time: 17:15

This talk's subject: we consider a language for high-level IC description. The language has two semantics: one defines its translation to VHDL and execution in an FPGA, an other is for fast modeling on a PC. If an author of an IC is allowed to use every possible construct of the language then the two semantics are clearly not equivalent, so the execution and modeling results may differ for the same input. If we restrict the language the semantics start to seem not that different. Work in progress for this project is to restrict the language in such a way that the semantics become actually equivalent and the language does not loose its applicability to FPGA development practice.

We may also discuss current applications of the language as a part of this seminar.

Presenter: Oleg Medvedev

Date: May 15, 2017

Time: 17:15

A new algorithm was proposed for the synthesis of finite automata by examples of behavior based on the use of effective methods for solving the feasibility problem. The main difference between the method and the known ones is the possibility of obtaining all possible minimal automata satisfying the initial data.

The article will be published in the Lecture Notes in Computer Science.

]]>