Sciweavers

815 search results - page 152 / 163
» Algebraic Recognizability of Languages
Sort
View
APAL
2002
73views more  APAL 2002»
14 years 9 months ago
The sequentially realizable functionals
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
John Longley
IANDC
2000
64views more  IANDC 2000»
14 years 9 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
JUCS
2002
131views more  JUCS 2002»
14 years 9 months ago
An Object-oriented Approach to Design, Specification, and Implementation of Hyperlink Structures Based on Usual Software Develop
: Different models and methodologies for the development of hypermedia systems and applications have emerged in the recent years. Software-technical methods and principles enriched...
Alexander Fronk
86
Voted
LISP
2002
107views more  LISP 2002»
14 years 9 months ago
Dependent Types for Program Termination Verification
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Hongwei Xi
JOT
2010
117views more  JOT 2010»
14 years 8 months ago
Formal Model and DSL for Separation of Concerns based on Views
The separation of concerns (SOC), as a conceptual tool, enables us to manage the complexity of software systems that we develop. The benefits of this paradigm, such as reuse, enhan...
Mehdi Adda, Hamid Mcheick, Hafedh Mili