LOIS: Syntax and Semantics

被引:0
|
作者
Kopczynski, Eryk [1 ]
Torunczyk, Szymon [1 ]
机构
[1] Univ Warsaw, Warsaw, Poland
关键词
Sets with atoms; definable sets;
D O I
10.1145/3009837.3009876
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present the semantics of an imperative programming language called LOIS (Looping Over Infinite Sets), which allows iterating through certain infinite sets, in finite time. Our semantics intuitively correspond to execution of infinitely many threads in parallel. This allows to merge the power of abstract mathematical constructions into imperative programming. Infinite sets are internally represented using first order formulas over some underlying logical structure, and SMT solvers are employed to evaluate programs.
引用
收藏
页码:586 / 598
页数:13
相关论文
共 50 条