首页 | 本学科首页   官方微博 | 高级检索  
     


Process Realizability: (Abstract)
Authors:Samson Abramsky
Affiliation:Laboratory for Foundations of Computer Science, The University of Edinburgh, James Clerk Maxwell Building, The King's Buildings, Mayfield Road, Edinburgh, EH9 3JZ, Scotland, U.K., http://www.dcs.ed.ac.uk/home/samson
Abstract:We introduce a notion of realizability for Classical Linear Logic, and describe a number of examples, including one based on concurrent games, and one based on the process calculus CCS.
Keywords:Realizability   Linear Logic   Process Calculi   Concurrency   CCS   Concurrent Games   Semantics
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号