Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
PCF
Description:
PCF, or point coordination function, is an optional medium-access control mechanism for coordinating transmissions in IEEE 802.11 wireless networks.
Primary topic:
Logic, programming, and type systems (48%)
Related topics:
Logic, programming, and type systems (48%),
French Historical and Cultural Studies (14%),
Wireless Networks and Protocols (9%)
OpenAlex ID:
keywords/pcf
On Full Abstraction for PCF: I, II, and III
2000
·
J.M.E. Hyland
, C.-H.L. Ong
·
Information and Computation
·
760
Full Abstraction for PCF
2000
·
Samson Abramsky
, Radha Jagadeesan
, et al.
·
Information and Computation
·
553
Les logiques du recrutement politique
1980
·
Daniel Gaxie
·
Revue française de science politique
·
220
PCF extended with real numbers
1996
·
Martin Hötzel Escardó
·
Theoretical Computer Science
·
197
Parametric polymorphism and operational equivalence
2000
·
ANDREW M. PITTS
·
Mathematical Structures in Computer Science
·
195
Hereditarily sequential functionals
1994
·
Hanno Nickau
·
Lecture notes in computer science
·
165
Call-by-value games
1998
·
Samson Abramsky
, Guy McCusker
·
Lecture notes in computer science
·
161
Full abstraction for functional languages with control
2002
·
J. Laird
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
157
Probabilistic coherence spaces as a model of higher-order probabilistic computation
2011
·
Vincent Danos
, Thomas Ehrhard
·
Information and Computation
·
140
PDF
A Curry-Howard foundation for functional computation with control
1997
·
C.-H. L. Ong
, C. A. Stewart
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
139
The geometry of interaction machine
1995
·
Ian Mackie
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
135
Realizability Toposes and Language Semantics
1995
·
John Longley
·
ERA
·
133
Full Abstraction for PCF (extended abstract)
1994
·
Samson Abramsky
, Pasquale Malacaria
, et al.
·
Lecture notes in computer science
·
130
A Core Quantitative Coeffect Calculus
2014
·
Aloïs Brunel
, Marco Gaboardi
, et al.
·
Lecture notes in computer science
·
129
PDF
Weighted Relational Models of Typed Lambda-Calculi
2013
·
Jim Laird
, Giulio Manzonetto
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
126
PDF
Bisimilarity as a Theory of Functional Programming
1995
·
Andrew D. Gordon
·
Electronic Notes in Theoretical Computer Science
·
110
PDF
Reasoning with higher-order abstract syntax in a logical framework
2002
·
Raymond C. McDowell
, Dale A. Miller
·
ACM Transactions on Computational Logic
·
109
PDF
Game-theoretic analysis of call-by-value computation
1999
·
Kohei Honda
, Nobuko Yoshida
·
Theoretical Computer Science
·
108
PDF
Linear Dependent Types and Relative Completeness
2012
·
Ugo Dal Lago
, Marco Gaboardi
·
Logical Methods in Computer Science
·
105
PDF
Bisimilarity as a theory of functional programming
1999
·
Andrew D. Gordon
·
Theoretical Computer Science
·
104
PDF
Sequentiality and the π-Calculus
2001
·
Martin Berger
, Kohei Honda
, et al.
·
Lecture notes in computer science
·
98
Medium access control (MAC)
2011
·
Bob O'Hara
, Al Petrick
·
Institute of Electrical and Electronics Engineers eBooks
·
96
Phytotoxic Protein PcF, Purification, Characterization, and cDNA Sequencing of a Novel Hydroxyproline-containing Factor Secreted by the Strawberry Pathogen Phytophthora cactorum
2001
·
Giuseppe Orsomando
, Maria Lorenzi
, et al.
·
Journal of Biological Chemistry
·
95
PDF
Linear Dependent Types and Relative Completeness
2011
·
Ugo Dal Lago
, Marco Gaboardi
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
94
Asynchronous Games: Innocence Without Alternation
2007
·
Paul-André Melliès
, Samuel Mimram
·
Lecture notes in computer science
·
87
PDF
Show more works
View as search
Works count:
778
Citation count:
9,131
Year
Topic
Type