Generation and analysis of lamplighter programs

07/09/2017
by   Carlos Martin, et al.
0

We consider a programming language based on the lamplighter group that uses only composition and iteration as control structures. We derive generating functions and counting formulas for this language with the goal of avoiding repetition of equivalent programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2022

Budge: a programming language and a theorem prover

We present a simple programming language based on Gödel numbering and pr...
research
06/04/2015

Programs as Polypeptides

We describe a visual programming language for defining behaviors manifes...
research
04/16/2021

{log}: Set Formulas as Programs

{log} is a programming language at the intersection of Constraint Logic ...
research
07/12/2019

Delta -- new logic programming language and Delta-methodology for p-computable programs on Turing Complete Languages

In paper describes the new logic programming language Delta, which have ...
research
08/07/2020

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME

Programming language concepts are used to give some new perspectives on ...
research
02/01/2019

Semantic Query Integration With Reason

Graph-based data models allow for flexible data representation. In parti...
research
11/13/2019

Zoea – Composable Inductive Programming Without Limits

Automatic generation of software from some form of specification has bee...

Please sign up or login with your details

Forgot password? Click here to reset