Sciweavers

1670 search results - page 225 / 334
» On Skolemization in constructive theories
Sort
View
ML
2006
ACM
103views Machine Learning» more  ML 2006»
16 years 12 days ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
OOPSLA
2005
Springer
15 years 12 months ago
Generalized algebraic data types and object-oriented programming
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
Andrew Kennedy, Claudio V. Russo
BIRTHDAY
2004
Springer
15 years 12 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
DIGRA
2003
Springer
15 years 11 months ago
Supporting visual elements of non-verbal communication in computer game avatars
Communication between players in networked computer games is often inadequately implemented. The games do not exploit the full potential of using different forms of communication ...
Tomi Kujanpää, Tony Manninen
CSR
2010
Springer
15 years 11 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma