
	Where results make sense

Topic: Samson Abramsky

Related Topics

Game semantics

Indian rebellion of 1857

Game theory

Regent College

Bishop Rock

1845

Judith Viorst

My Hero

Creature of statute

Culann

Falls Creek, Pennsylvania

Jesus Alou

Birchwood, Wisconsin

Columbia, Alabama

Cot

In the News (Tue 14 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Yehezkel Abramsky - Wikipedia, the free encyclopedia
		He was born in Lithuania, the third child and eldest son of Mordecai Zalman Abramsky, a local timber merchant, and his wife, Freydel Goldin of Grodno, and studied at the yeshivas of Telz, Mir, Slabodka and particularly Brisk under Hayyim Soloveitchik, becoming a rabbi at the age of 17.
		He was the father of Professor Chimen Abramsky (and three other sons) and grandfather of Professor Samson Abramsky and Jenny Abramsky.
		Abramsky died in Jerusalem on 19 September, 1976.
	en.wikipedia.org /wiki/Yehezkel_Abramsky (400 words)

	Samson Abramsky - Wikipedia, the free encyclopedia
		Samson Abramsky, FRS (born March 12, 1953) is a computer scientist.
		Since the Year 2000, he has been a Fellow of the Royal Society of Edinburgh, a Fellow of Wolfson College, Oxford and Christopher Strachey Professor of Computing at Oxford University Computing Laboratory.
		He was educated at King's College, Cambridge (BA 1975, MA Philosophy 1979, Diploma in Computer Science) and Queen Mary, University of London (PhD Computer Science 1988).
	en.wikipedia.org /wiki/Samson_Abramsky (209 words)

	Abramsky (Site not responding. Last check: 2007-10-29)
		Article by Samson Abramsky which proposes a formulae-as-types correspondence first for intuitionsitic linear logic, and then for classical linear logic.
		Sasha Abramsky is a freelance journalist whose work has appeared in The Atlantic Monthly, New York magazine, the Village Voice, Rolling Stone and The Nation.
		Abramsky says that the stock already has priced in the companys superior growth, competitive advantage, solid execution and strong product cycle.
	www.teethanddentistry.com /teeth-and-dentistry/abramsky.html (697 words)

	DBLP: Samson Abramsky
		Samson Abramsky, Guy McCusker: Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions.
		Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: Specification Structures and Propositions-as-Types for Concurrency.
		Samson Abramsky, Thomas P. Jensen: A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions.
	informatik.uni-trier.de /~ley/db/indices/a-tree/a/Abramsky:Samson.html (980 words)

	DBLP: Samson Abramsky
		Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott: Geometry of Interaction and Linear Combinatory Algebras.
		Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: A Specification Structure for Deadlock-Freedom of Synchronous Processes.
		Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: Interaction categories and the foundations of typed concurrent programming.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/a/Abramsky:Samson.html (980 words)

	DBLP: Radha Jagadeesan (Site not responding. Last check: 2007-10-29)
		Samson Abramsky, Radha Jagadeesan: A game semantics for generic polymorphism.
		Samson Abramsky, Radha Jagadeesan: New Foundations for the Geometry of Interaction Inf.
		Samson Abramsky, Radha Jagadeesan: New Foundations for the Geometry of Interaction LICS 1992: 211-222
	www.vldb.org /dblp/db/indices/a-tree/j/Jagadeesan:Radha.html (810 words)

	Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan (ResearchIndex) (via CobWeb/3.1 ... (Site not responding. Last check: 2007-10-29)
		Samson Abramsky and Radha Jagadeesan Department of Computing Imperial College...
		A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction.
		6 To appear (context) - Abramsky, of et al.
	citeseer.ist.psu.edu.cob-web.org:8888 /564168.html (837 words)

	Logic and Semantics Seminar - 6th and 7th December 2004: Samson Abramsky and Bob Coecke (Site not responding. Last check: 2007-10-29)
		Samson Abramsky and Bob Coecke, University of Oxford
		In [Abramsky and Coecke 2004] we addressed these problems, the key ingredient being a categorical axiomatization of quantum mechanics.
		The talk will be in two parts: the first part, given by Abramsky, will give an overview of our work, and the second part, by Coecke, will supply more detail, and examine a case study of verifying the teleportation protocol.
	cl.cam.ac.uk /Research/LS/Talks/2004_05/2004-12-06.Abramsky-Coecke.html (435 words)

	QiSci » Blog Archive » Quantum mechanics with pictures: A graphical calculus for quantum information flow - ... (Site not responding. Last check: 2007-10-29)
		Recently, Samson Abramsky and Bob Coecke introduced a “graphical calculus for quantum information” which captures pictorially the flow of quantum information through bi-partite entangling measurements.
		The picture calculus can be more formally described using “category theory”, a comparitively lesser known branch of mathematics which is a language for reasoning about mathematical structures and maps between them in an abstract way.
		Samson Abramsky and Bob Coecke “A categorical semantics of quantum protocols”, quant-ph/0402130
	www.qinfo.org /?p=147 (355 words)

	Games for Recursive Types - Abramsky, McCusker (ResearchIndex) (Site not responding. Last check: 2007-10-29)
		A Game Semantics for Generic Polymorphism - Samson Abramsky And (2003)
		10: Full abstraction for PCF - Abramsky, Jagadeesan et al.
		144 Full abstraction for PCF - Abramsky, Jagadeesan et al.
	citeseer.ist.psu.edu /abramsky94games.html (483 words)

	Strong Completeness Theorem for MLL
		If anyone has difficulty decoding this, let us know and we'll send you an unformatted version.
		Samson Abramsky and Radha Jagadeesan ------------------------------- \documentstyle[11pt]{article} \newtheorem{theorem}{Theorem} \newcommand{\entails}{\mbox{$\;\vdash$}} \newcommand{\tensor}{\mbox{$\otimes$}} \newcommand{\category}[1]{{\bf #1}} \newcommand{\mytwotrans}[2]{\mbox{$ \frac{\mbox{$#1$}}{\mbox{$#2$}}$}} \author{Samson Abramsky and Radha Jagadeesan} \title{A Strong Completeness Theorem for Multiplicative Linear Logic:\\ Preliminary Announcement} \begin{document} \maketitle \section{Background} Blass has recently described a Game semantics for Linear Logic in which formulas are interpreted by games and proofs by winning strategies.
		This has good claims to be the most intuitively appealing semantics for Linear Logic presented so far.
	www.cis.upenn.edu /~bcpierce/types/archives/1992/msg00075.html (1247 words)

	DBLP: Samson Abramsky
		Samson Abramsky, Bob Coecke: Discrete classical vs. continuous quantum data in abstract quantum mechanics.
		Samson Abramsky, Marios Mavronicolas: Game Theory Meets Theoretical Computer Science.
		Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky: OOPSLA panel on object-based concurrent programming.
	sunsite.informatik.rwth-aachen.de /dblp/db/indices/a-tree/a/Abramsky:Samson.html (954 words)

	Fully Complete Models for ML Polymorphic Types - Abramsky, Lenisa (ResearchIndex) (via CobWeb/3.1 planetlab2.tamu.edu) (Site not responding. Last check: 2007-10-29)
		Samson Abramsky Marina Lenisa Laboratory for the Foundations of Computer...
		4 Geometry of Interaction and Models of Combinatory Logic (context) - Abramsky, Haghverdi et al.
		2 Parametric Polymorphism (context) - Abramsky, Lenisa et al.
	citeseer.ist.psu.edu.cob-web.org:8888 /304057.html (849 words)

	CiteULike: Kindergarten Quantum Mechanics (Site not responding. Last check: 2007-10-29)
		These lecture notes survey some joint work with Samson Abramsky as it was presented by me at several conferences in the summer of 2005.
		This picture calculus can be seen as a very substantial extension of Dirac's notation, and has a purely algebraic counterpart in terms of so-called Strongly Compact Closed Categories (introduced by Abramsky and I in quant-ph/0402130 and [4]) which subsumes my Logic of Entanglement quant-ph/0402014.
		For a survey on the `what', the `why' and the `hows' I refer to a previous set of lecture notes quant-ph/0506132.
	www.citeulike.org /user/ansobol/article/341531 (323 words)

	Summer School on Games and Computation (Site not responding. Last check: 2007-10-29)
		In particular, two areas where there has been rapid progress recently are: game semantics and its applications to programming languages and logic; and the use of games in verifying properties of concurrent processes.
		Game semantics has been used to give the first syntax-independent constructions of fully abstract models for functional languages such as PCF and FPC (Abramsky,Jagadeesan and Malacaria, Hyland and Ong, Nickau, McCusker), for imperative languages such as Idealized Algol (Abramsky and McCusker), and for languages with non-local control operators such as call-cc (Ong, Laird).
		SPEAKERS Samson Abramsky, Edinburgh University Martin Hyland, Cambridge University Perdita Stevens, Edinburgh University Colin Stirling, Edinburgh University Wolfgang Thomas, Christian-Albrechts University, Kiel GRANTS A small number of grants for the Summer School are available for PhD students.
	www.cis.upenn.edu /~bcpierce/types/archives/1997-98/msg00065.html (239 words)

	Samson Abramsky Books - Signed, used, new, out-of-print
		Logic is now widely recognized to be one of the foundational disciplines of computing, and its applications reach almost every aspect of the subject, from software engineering and hardware to programming languages and artificial intelligence research.
		Logic is now widely recognized as one of the foundational disciplines of computing, and its applications reach almost every aspect of the subject, from software engineering and hardware to programming languages and AI.
		The papers in this volume were presented at the fourth biennial SummerConference on Category Theory and Computer Science, held in Paris, September3-6, 1991.
	www.alibris.co.uk /search/books/author/Samson_Abramsky (743 words)

	Bibliography on Linear Logic (Site not responding. Last check: 2007-10-29)
		In S. Abramsky, P.-L. Curien, A. Pitt, D. Pitts, A. Poigné, and D. Rydeheard, editors, Category Theory and Computer Science, Springer-Verlag LNCS 530, pages 121-137, Paris, France, September 1991.
		In S. Abramsky, editor, Ninth Annual Symposium on Logic in Computer Science, pages 272-281, Paris, France, July 1994.
		In S. Abramsky, P.-L. Curien, A. Pitts D. Pitt,, A. Poigné, and D. Rydeheard, editors, Proceedings of the Conference on Category Theory and Computer Science, pages 74-93, Paris, France, 1991.
	www-2.cs.cmu.edu /~carsten/linearbib/llb.html (6680 words)

	Books by Thomas S. E. Maibaum, compare prices
		by Dov M. Gabbay, Dov M. Gabbay (Editor), Thomas S. Maibaum (Editor), Samson Abramsky, Samson Abramsky (Editor)
		Abramsky, Dov M. Gabbay, Thomas S. Maibaum (Editor)
		by Thomas S. Maibaum (Editor), Samson Abramsky, International Joint Conference on Theory and Practice of Software Deve
	www.allbookstores.com /author/Thomas_S_E_Maibaum.html (320 words)

	Handbook of Logic in Computer Science Abramsky, Samson (EDT)/ Gabbay, Dov M./ Maibaum, Thomas S. E. (EDT)/ Abramsky, ...
		Handbook of Logic in Computer Science Abramsky, Samson (EDT)/ Gabbay, Dov M./ Maibaum, Thomas S. (EDT)/ Abramsky, Samson/ Gabbay, Dov M. (EDT)- Textbook - Bookbyte.com
		Handbook of Logic in Computer Science by Abramsky, Samson (EDT)/ Gabbay, Dov M./ Maibaum, Thomas S. (EDT)/ Abramsky, Samson/ Gabbay, Dov M. Semantic Structures
		by Abramsky, Samson (EDT) Gabbay, Dov M. Maibaum, Thomas S. Abramsky, Samson Gabbay, Dov M. Publisher Oxford Univ Pr
	www.bookbyte.com /product.aspx?isbn=019853762X (119 words)

	samson abramsky - ResearchIndex document query
		The Lazy Lambda Calculus Samson Abramsky Department of Computing Imperial College of
		Full Abstraction for PCF - Samson Abramsky University (1994)
		Technical Report I wish to thank my examiners, Samson Abramsky and Robin Milner, for their comments,
	citeseer.ist.psu.edu /cis?q=Samson+Abramsky (262 words)

	The Mathematics Genealogy Project - Samson Abramsky
		Click here to see the students listed in chronological order.
		According to our current on-line database, Samson Abramsky has 2 students and 5 descendants.
		If you have additional information or corrections regarding this mathematician, please use the update form.
	genealogy.math.ndsu.nodak.edu /html/id.phtml?id=67094 (86 words)

	OASIS - Samson Abramsky
		Samson Abramsky FRS is OUCL's Christopher Strachey Professor of Computing and is the Head of the Theory and Automated Verification Group.
		ABSTRACT: We consider the following questions: What kind of logic has a natural semantics in multi-player (rather than 2-player) games?
		Site last produced on Fri Nov 24 11:06:14 GMT 2006.
	se10.comlab.ox.ac.uk:8080 /InformaticPhenomena/SamsonAbramsky_en.html (142 words)

	Best Book Buys - Search (Site not responding. Last check: 2007-10-29)
		by Samson Abramsky (Editor), S. Abramsky, Dov M. Gabbay, Dov M. Gabbay (Editor), T.S.E. Maibaum (Editor), Thomas S. Maibaum (Editor), Samson Abramsky
		by Samson Abramsky (Editor), S. Abramsky (Editor), Dov M. Gabbay (Editor), T.S.E. Maibaum (Editor), Thomas S. Maibaum (Editor)
		All trademarks are owned by the respective company or Best Web Buys.
	wc.bestwebbuys.com /S_Abramsky-author.html?... (252 words)

	Amazon.com: Tapsoft '91. Proceedings of the International Joint Conference on Theory and Practice of Software ... (Site not responding. Last check: 2007-10-29)
		Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991: Volume (Lecture Notes in Computer Science): Books: S. Abramsky,T. Maibaum,Samson Abramsky
		This item is not eligible for Amazon Prime, but over a million other items are.
		Maibaum (Editor), Samson Abramsky (Other Contributor) "In recent years, many models of concurrent computation based upon partial orders have been proposed in the literature, e.g.
	www.amazon.com /Proceedings-International-Conference-Practice-Development/dp/3540539824 (1060 words)

Try your search on: Qwika (all wikis)