Nominal terms (computer science)

Known as: Nominal terms 
Nominal terms are a metalanguage for embedding object languages with binding constructs into. Intuitively, they may be seen as an extension of first… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2018
05101519892018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper introduces a novel model for semantic role labeling that makes use of neural sequence modeling techniques. Our… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
This thesis studies two major extensions of nominal terms. In particular, we study an extension with λ-abstraction over nominal… (More)
  • figure 3.3
  • figure 4.3
  • figure 5.2
  • figure 5.1
Is this relevant?
2009
2009
Nominal terms use a characteristic combination of features: Two levels of variable: atoms a and unknowns X. Freshness conditions… (More)
Is this relevant?
2009
2009
This paper presents a mechanisation of psi-calculi, a parametric framework for modelling various dialects of process calculi… (More)
  • table 1
Is this relevant?
2008
2008
We present a simplified version of nominal terms with improved properties. Nominal terms are themselves a version of first-order… (More)
Is this relevant?
2007
2007
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting… (More)
Is this relevant?
2006
2006
We define a rank 1 polymorphic type system for nominal terms, where typing environments type atoms, variables and function… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We develop a utility based model of fluctuations, with nominal rigidities, and unemployment. In doing so, we combine two strands… (More)
Is this relevant?
2004
2004
P ublic concern over the affordability of housing arises from two factors. First, housing is the single largest expenditure item… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula… (More)
Is this relevant?