Sciweavers

3319 search results - page 319 / 664
» Subshifts, Languages and Logic
Sort
View
ICLP
1999
Springer
15 years 11 months ago
Binding-time Analysis for Mercury
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
Wim Vanhoof, Maurice Bruynooghe
ASIAN
1998
Springer
99views Algorithms» more  ASIAN 1998»
15 years 11 months ago
Eventuality in LOTOS with a Disjunction Operator
LOTOS is a formal specification language, designed for the precise description of open distributed systems and protocols. Our purpose is to introduce the operators of logics (for e...
Yoshinao Isobe, Yutaka Sato, Kazuhito Ohmaki
ICALP
1990
Springer
15 years 10 months ago
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
Jan Willem Klop
LILOG
1989
15 years 10 months ago
Representation and Reasoning with Attributive Descriptions
This paper surveys terminological representation languages and feature-based unification grammars pointing out the similarities and differences between these two families of att...
Bernhard Nebel, Gert Smolka
EACL
1993
ACL Anthology
15 years 8 months ago
The donkey strikes back: Extending the dynamic interpretation "constructively"
The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treatments of implication, universal quantification, negat...
Tim Fernando