Информационная система "Конференции"

Abstracts

Applications of logic in computer science

We exhibit Cartwright-Curien-Felleisen’s model of observably sequential algorithms as a full subcategory of Laird’s bistable biorders, thereby reconciling two views of functions: functions-as-algorithms (or programs), and functions-as-relations. We then characterize affine sequential algorithms as affine bistable functions in the full subcategory of locally boolean orders. Full text in PDF-faile.

Additional information:

Full text: laird-sa.pdf (163 kb)

Mail to Webmaster alc9@math.nsc.ru

|Home Page| |English Part|

Go to Home