Pion-nucleon scattering amplitudes from data and fixedt-analyticity

Höhler, G.

doi:10.1007/bf01595094

Cited by 5 publications

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Software Components as Invariant-Typed Arrows

Barbosa

2012

Programming Languages

View full text Add to dashboard Cite

Invariants are constraints on software components which restrict their behavior in some desirable way, but whose maintenance entails some kind of proof obligation discharge. Such constraints may act not only over the input and output domains, as in a purely functional setting, but also over the underlying state space, as in the case of reactive components. This talk introduces an approach for reasoning about invariants which is both compositional and calculational: compositional because it is based on rules which break the complexity of such proof obligations across the structures involved; calculational because such rules are derived thanks to an algebra of invariants encoded in the language of binary relations. A main tool of this approach is the pointfree transform of the predicate calculus, which opens the possibility of changing the underlying mathematical space so as to enable agile algebraic calculation. The development of a theory of invariant preservation requires a broad, but uniform view of computational processes embodied in software components able to take into account data persistence and continued interaction. Such is the plan for this talk: we first introduce such processes as arrows, and then invariants as their types.

show abstract

Software Components as Invariant-Typed Arrows

Barbosa

2012

Programming Languages

View full text Add to dashboard Cite

show abstract

Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras

Ciancia

2013

Algebra and Coalgebra in Computer Science

View full text Add to dashboard Cite

We use dialgebras, generalising both algebras and coalgebras, as a complement of the standard coalgebraic framework, aimed at describing the semantics of an interactive system by the means of reaction rules. In this model, interaction is built-in, and semantic equivalence arises from it, instead of being determined by a (possibly difficult) understanding of the side effects of a component in isolation. Behavioural equivalence in dialgebras is determined by how a given process interacts with the others, and the obtained observations. We develop a technique to inter-define categories of dialgebras of different functors, that in particular permits us to compare a standard coalgebraic semantics and its dialgebraic counterpart. We exemplify the framework using the CCS and the π-calculus. Remarkably, the dialgebra giving semantics to the π-calculus does not require the use of presheaf categories. ⋆ The research leading to these results was partially supported by the EU FET 7FP Collaborative Project n. 600708 (QUANTICOL), the PAR FAS 2007-2013 (TRACE-IT) project, and the EU 7FP projects n. 256980 (NESSoS), n. 257930 (Aniketos), n. 295354 (SESAMO).

show abstract

Present status of the experimental testing of the forward K+-p and pp, ¯pp dispersion relations

Dumbrājs

Staszel

1976

Czech J Phys

View full text Add to dashboard Cite

Pion-nucleon scattering amplitudes from data and fixedt-analyticity

Cited by 5 publications

References 23 publications

Software Components as Invariant-Typed Arrows

Software Components as Invariant-Typed Arrows

Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras

Present status of the experimental testing of the forward K+-p and pp, ¯pp dispersion relations

Contact Info

Product

Resources

About