Sequential algorithms and strongly stable functions

Sequential algorithms and strongly stable functions (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Paul-André Melliès

Venue:	in the Linear Summer School, Azores
Citations:	10 - 3 self

BibTeX

@INPROCEEDINGS{Melliès03sequentialalgorithms,
    author = {Paul-André Melliès},
    title = {Sequential algorithms and strongly stable functions },
    booktitle = {in the Linear Summer School, Azores},
    year = {2003},
    publisher = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

363	LCF considered as a programming language - Plotkin - 1977
197	Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
174	On full abstraction for pcf - Hyland, Ong - 2000
173	Full abstraction for PCF - Abramsky, Jagadeesan, et al. - 2000
142	logic: Its syntax and semantics - Linear - 1993
121	Modeling concurrency with geometry - Pratt
92	What is a Categorical Model of Intuitionistic Linear Logic - Bierman - 1995
83	Sequential algorithms on concrete data structures - Berry, Curien - 1982
65	Full abstraction for PCF (extended abstract - Abramsky, Jagadeesan, et al. - 1994
56	Hereditarily sequential functionals - Nickau - 1994
55	Hypercoherences: a strongly stable model of linear logic - Ehrhard - 1993
47	Sequentiality and strong stability - Bucciarelli, Ehrhard - 1991
46	Concurrent games and full completeness - Abramsky, Melliès - 1999
46	Games and full abstraction for a functional metalanguage with recursive types. Distinguished Dissertation Series - McCusker - 1998
44	Game semantics - Abramsky, McCusker - 1999
43	A type-theoretical alternative to ISWIM - Scott - 1993
37	Remarques sur la théories des jeux à deux personnes. Gazette des sciences mathématiques du Québec - Joyal - 1977
34	On the symmetry of sequentiality - Curien - 1993
23	Categorical models of linear logic revisited. Prépublication PPS n o 22 - Melliès - 2003
22	Projecting sequential algorithms on strongly stable functions - Ehrhard - 1996
21	A combinatory algebra for sequential functionals of finite type - Oosten - 1997
21	Asynchronous games 2: The true concurrency of innocence,” Theor - Melliès - 2006
14	Modèles complètement adéquats et stables des λ-calcul typés. Thèse de doctorat d’Etat, Université Paris VII - Berry - 1979
14	Games on Graphs and Sequentially Realizable Functionals. Extended Abstract - Hyland, Schalk - 2002
11	A relative definability result for strongly stable functions and some corollaries - Ehrhard - 1997
5	Anatomy of an extensional collapse - Barreiro, Ehrhard - 1998
5	Free lattices, communication and money games - Joyal - 1997
5	Comparing hierarchies of types in models of linear logic - Melliès - 2004
5	Mu-Bicomplete Categories and Parity Games - Santocanale - 2002
4	Sequentiality vs - Abramsky
3	Hypercohérence et jeux - Boudes - 2002
3	Parallel and serial hypercoherences - Ehrhard - 2000
1	The sequentialy realizable functionals. Submitted to - Longley - 1998
1	Axiomatic Rewriting Theory 4: a stability theorem in rewriting theory - Melliès - 1998
1	Sequentiality and extensionality. 13 pages. Unpublished notes circulated at the Linear Summer School. Azores - Melliès - 2000
1	Innocence in 2-dimensional games. 7 pages. Presented at the Linear Logic workshop - Melliès - 2002
1	Modèles complètement adéquats et stables des�-calcul typés. Thèse de doctorat d’Etat, Université Paris VII - Berry - 1979