Sciweavers

1055 search results - page 88 / 211
» Enumerations in computable structure theory
Sort
View
FOAL
2009
ACM
15 years 11 months ago
A type system for functional traversal-based aspects
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
Bryan Chadwick, Karl J. Lieberherr
BC
2005
122views more  BC 2005»
15 years 4 months ago
On partial contraction analysis for coupled nonlinear oscillators
We describe a simple but general method to analyze networks of coupled identical nonlinear oscillators, and study applications to fast synchronization, locomotion, and schooling. ...
Wei Wang 0008, Jean-Jacques E. Slotine
FSTTCS
2004
Springer
15 years 9 months ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...
STORYTELLING
2005
Springer
15 years 9 months ago
Formal Encoding of Drama Ontology
The goal of this research is to lay the foundations for a formal theory , that abstracts from the procedural and interactive aspects involved in the generation of dramatic content....
Rossana Damiano, Vincenzo Lombardo, Antonio Pizzo
FP
1995
110views Formal Methods» more  FP 1995»
15 years 8 months ago
Using Types to Parse Natural Language
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type...
Mark P. Jones, Paul Hudak, Sebastian Shaumyan