Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Plotkin bound

Known as: Plotkin 
In the mathematics of coding theory, the Plotkin bound, named after Morris Plotkin, is a limit (or bound) on the maximum possible number of codewords… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
We present an order-extensional, order (or inequationally) fully abstract model for Scott's language pcf. The approach we have… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1993
Highly Cited
1993
In order to simplify the compilation process, many compilers for higher-order languages use the continuation-passing style (CPS… Expand
  • figure 1
  • figure 5
  • figure 6
  • figure 8
Highly Cited
1992
Highly Cited
1992
In this paper the question is considered in which cases a transition system specification in Plotkin style has ‘good’ properties… Expand
  • figure 1
  • table 1
  • table 2
  • table 4
Highly Cited
1992
Highly Cited
1992
This paper investigates the transformation of λ ν -terms into continuation-passing style (CPS). We show that by appropriate… Expand
Highly Cited
1992
Highly Cited
1992
Abstract The syntactic theories of control and state are conservative extensions of the λ υ -calculus for equational reasoning… Expand
  • figure 1
Highly Cited
1991
Highly Cited
1991
  • E. Moggi
  • Inf. Comput.
  • 1991
  • Corpus ID: 12767331
Abstract The λ-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be… Expand
  • table 1
  • table 2
  • table 3
  • table 5
  • table 6
Highly Cited
1989
Highly Cited
1989
  • E. Moggi
  • [] Proceedings. Fourth Annual Symposium on Logic…
  • 1989
  • Corpus ID: 5411355
The lambda -calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses beta… Expand
  • table 1
  • table 2
  • table 3
Highly Cited
1987
Highly Cited
1987
  • G. Kahn
  • STACS
  • 1987
  • Corpus ID: 17630821
During the past few years, many researchers have begun to present semantic specifications in a style that has been strongly… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Highly Cited
1981
Highly Cited
1981
  • D. Park
  • Theoretical Computer Science
  • 1981
  • Corpus ID: 206841958
The paper is concerned with ways in which fair concurrency can be modelled using notations for omega-regular languages… Expand
Highly Cited
1981
Highly Cited
1981
Abstract The general aim of this paper is to find a theory of concurrency combining the approaches of Petri and Scott (and others… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5