Sciweavers

3238 search results - page 257 / 648
» On the Computational Interpretation of Negation
Sort
View
ECAI
2010
Springer
15 years 7 months ago
Acquisition of Grammar in Autonomous Artificial Systems
Over the past several decades, psycholinguists have gained countless insights into the process of child language acquisition. Can these findings be used for the development of lang...
Kateryna Gerasymova, Michael Spranger
ENTCS
2008
129views more  ENTCS 2008»
15 years 6 months ago
The York Abstract Machine
Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
Greg Manning, Detlef Plump
ENTCS
2006
109views more  ENTCS 2006»
15 years 6 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
ENTCS
2007
99views more  ENTCS 2007»
15 years 6 months ago
Nominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
Ranald A. Clouston, Andrew M. Pitts
APAL
2005
90views more  APAL 2005»
15 years 6 months ago
Explicit mathematics: power types and overloading
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
Thomas Studer