5499 search results - page 83 / 1100 » Generalized Rewrite Theories |
TACS
1994
Springer
14 years 2 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
CIE
2005
Springer
14 years 3 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
SIGSOFT
2010
ACM
13 years 8 months ago
2010
ACM
Like programs, programming languages are not only mathematical objects but also software engineering artifacts. Describing the semantics of real-world languages can help bring lan...
ECAL
2001
Springer
14 years 2 months ago
2001
Springer
Since the concept of autopoiesis was proposed as a model of minimal living systems by Maturana and Varela, and applied to social systems by Luhmann, there has been only a few math...
AUTOMATICA
2004
13 years 10 months ago
2004
This paper addresses the problem of dynamics analysis in optical networks from a system control perspective. A general framework for