On the algebraic structure of declarative programming languages
نویسندگان
چکیده
منابع مشابه
On the algebraic structure of declarative programming languages
We develop an algebraic framework, Logic Programming Doctrines, for the syntax, proof theory, operational semantics and model theory of Horn Clause logic programming based on indexed premonoidal categories. Our aim is to provide a uniform framework for logic programming and its extensions capable of incorporating constraints, abstract data types, features imported from other programming languag...
متن کاملthe structure of lie derivations on c*-algebras
نشان می دهیم که هر اشتقاق لی روی یک c^*-جبر به شکل استاندارد است، یعنی می تواند به طور یکتا به مجموع یک اشتقاق لی و یک اثر مرکز مقدار تجزیه شود. کلمات کلیدی: اشتقاق، اشتقاق لی، c^*-جبر.
15 صفحه اولthe effects of changing roughness on the flow structure in the bends
flow in natural river bends is a complex and turbulent phenomenon which affects the scour and sedimentations and causes an irregular bed topography on the bed. for the reason, the flow hydralics and the parameters which affect the flow to be studied and understand. in this study the effect of bed and wall roughness using the software fluent discussed in a sharp 90-degree flume bend with 40.3cm ...
Formalizing Deterministic Semantics of Declarative Programming Languages
Although every implementation of a (functional) logic programming language is deterministic, the languages' semantics are almost always formalized as a \nondeterministic" binary relation. Hence, there still exists a gap between the semantics of a (functional) logic programming language and its implementation which has to be closed in particular if the correctness of the implementation is to be ...
متن کاملAlgebraic Processing of Programming Languages
Current methodology for compiler construction evolved from the need to release programmers form the burden of writing machine-language programs. This methodology does not assume a formal concept of a programming language and is not based on mathematical algorithms that model the behavior of a compiler. The side eeect is that compiler implementation is a diicult task and the correctness of a com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.038