Tabling, Rational Terms, and Coinduction Finally Together!

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tabling, Rational Terms, and Coinduction Finally Together!

Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program de nitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more in nite subterms but with a nite representation. Rational terms can be generated in Prolog by omitting the occurs check when unifying two ...

متن کامل

Chiral anomaly and unambiguous rational terms

Through more detailed calculations on QED1+1 and QED3+1, we attribute the regularization independent and hence definite origin of chiral anomaly in perturbation theory to an unambiguous term which is a rational function in momentum space. Some relevant remarks are presented. 0∗ E-mail:[email protected]

متن کامل

Direct Extraction Of One Loop Rational Terms

We present a method for the direct extraction of rational contributions to one-loop scattering amplitudes, missed by standard four-dimensional unitarity techniques. Working in D = 4 − 2ǫ dimensions, we interpret the dependence on the additional dimensions as equivalent to introducing an internal mass. We combine this with the use of generalised unitarity to write the loop amplitudes in terms of...

متن کامل

Generalized Coinduction

We introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor F. Parameterised by T and λ it generalizes the basic coiteration schema uniquely characterising functions into a final F-coalgebra. Furthermore, the same parameters are used to generalize the categorical notion of a bisimulation to that of a λ-bisimulation, still giving rise to a proof technique for bis...

متن کامل

Automata and Coinduction

The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2014

ISSN: 1471-0684,1475-3081

DOI: 10.1017/s147106841400012x