Sciweavers

941 search results - page 128 / 189
» Mathematics on the (Semantic) NET
Sort
View
77
Voted
WOLLIC
2007
Springer
15 years 6 months ago
A Formal Calculus for Informal Equality with Binding
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
Murdoch Gabbay, Aad Mathijssen
IJCNN
2006
IEEE
15 years 6 months ago
Knowledge Representation and Possible Worlds for Neural Networks
— The semantics of neural networks can be analyzed mathematically as a distributed system of knowledge and as systems of possible worlds expressed in the knowledge. Learning in a...
Michael J. Healy, Thomas P. Caudell
94
Voted
ISSAC
2005
Springer
94views Mathematics» more  ISSAC 2005»
15 years 6 months ago
Domains and expressions: an interface between two approaches to computer algebra
This paper describes a method to use compiled, strongly typed Aldor domains in the interpreted, expression-oriented Maple environment. This represents a non-traditional approach t...
Cosmin E. Oancea, Stephen M. Watt
74
Voted
MPC
2004
Springer
116views Mathematics» more  MPC 2004»
15 years 6 months ago
An Injective Language for Reversible Computation
Abstract. Erasure of information incurs an increase in entropy and dissipates heat. Therefore, information-preserving computation is essential for constructing computers that use e...
Shin-Cheng Mu, Zhenjiang Hu, Masato Takeichi
117
Voted
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 5 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh