Sciweavers

3378 search results - page 18 / 676
» A universe of binding and computation
Sort
View
MCU
2004
105views Hardware» more  MCU 2004»
14 years 8 days ago
Computational Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blon...
SCP
2002
59views more  SCP 2002»
13 years 10 months ago
The universal resolving algorithm and its correctness: inverse computation in a functional language
We present an algorithm for inverse computation in a
Sergei M. Abramov, Robert Glück
TLCA
2005
Springer
14 years 4 months ago
Proof Contexts with Late Binding
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
Virgile Prevosto, Sylvain Boulmé
IIE
2008
127views more  IIE 2008»
13 years 11 months ago
Object-Oriented Programming in Bulgarian Universities' Informatics and Computer Science Curricula
Teaching object-oriented programming (OOP) is related to many difficulties. There is no single view on their causes among the university teachers. The results of applying various m...
Ivaylo Donchev, Emilia Todorova
FCT
2001
Springer
14 years 3 months ago
Universal Algebra and Computer Science
Abstract. Generalising modules over associative rings, the notion of modules for an endofunctor of any category is well established and useful in large parts of mathematics includi...
Boris I. Plotkin, Tanya Plotkin