Sciweavers

66 search results - page 9 / 14
» Rewriting Haskell Strings
Sort
View
ACL
2006
13 years 9 months ago
Polarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...
Sylvain Kahane
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
CSFW
2003
IEEE
14 years 27 days ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell
BIBE
2005
IEEE
121views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
RNA Pseudoknot Prediction Using Term Rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in a...
Xuezheng Fu, Hao Wang, William L. Harrison, Robert...
FLOPS
2004
Springer
14 years 1 months ago
Basic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
Wolfram Kahl