论文信息 - Quantitative Domains, Groupoids and Linear Logic

Quantitative Domains, Groupoids and Linear Logic

We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of factorisation through candidates. There are many mathematical examples, including the Zariski spectrum of a ring (as shown by Diers [81]) and the Galois group of a polynomial, but we are mainly interested in Berry's [78] minimum data property. In fact we begin with a completely non-mathematical example.

Paul Taylor | P. Taylor

[1] Yves Lafont. The Linear Abstract Machine (Corrigenda) , 1988, Theor. Comput. Sci..

[2] Jean-Yves Girard,et al. Normal functors, power series and λ-calculus , 1988, Ann. Pure Appl. Log..

[3] Gérard Berry,et al. Stable Models of Typed lambda-Calculi , 1978, ICALP.

[4] M. Barr,et al. Toposes, Triples and Theories , 1984 .

[5] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .

[6] Jean-Yves Girard,et al. Towards a geometry of interaction , 1989 .

[7] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..

[8] Andrew M. Pitts,et al. The theory of constructions: Categorical semantics and topos-theoretic models , 1987 .

[9] Yves Lafont,et al. The Linear Abstract Machine , 1988, Theor. Comput. Sci..

[10] A. Joyal. Foncteurs analytiques et espèces de structures , 1986 .

[11] John W. Gray,et al. Categories in Computer Science and Logic , 1989 .

[12] Jean-Yves Girard,et al. Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[13] Paul Taylor. Internal Completeness of Categories of Domains , 1985, CTCS.

[14] Pierre-Louis Curien,et al. The Categorical Abstract Machine , 1987, Sci. Comput. Program..

[15] Paul Taylor. An algebraic approach to stable domains , 1990 .

[16] Yves Diers. Some spectra relative to functors , 1981 .

[17] Jean-Yves Girard,et al. The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..