Skip to search formSkip to main content

Nullary constructor

Known as: 0-argument constructor 
In computer programming, a nullary constructor is a constructor that takes no arguments. Also known as a 0-argument constructor.
Wikipedia

Related topics

Related topics

4 relations
Default constructorEnumerated typeHibernate ORM

Broader (1)

Method (computer programming)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Corecursion and coinduction : what they are and how they relate to recursion and induction
 
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
System Description: Delphin - A Functional Programming Language for Deductive Systems
Delphin is a functional programming language [Adam Poswolsky and Carsten Schurmann. Practical programming with higher-order… Expand
Is this relevant?
2003
2003
Guide to J2EE: Enterprise Java
PART 1: BACKGROUND Why J2EE? Introduction to Distributed Systems The J2EE Tour Java Remote Method Invocation Activate Yourself… Expand
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
A Kleene Analysis of Mobile Ambients
We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
1998
1998
Java: Data Structures and Programming
  • Liwu Li
  • Springer Berlin Heidelberg
  • 1998
Part I. Java Programming: Data Modeling in Java The Java Language Programming in Java Java Data Structure Classes Part II… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 1.1
Is this relevant?
Review
1997
Review
1997
First-Order Functional Languages and Intensional Logic
The purpose of this paper is to demonstrate that first-order functional programs can be transformed into intensional programs of… Expand
  • table 1
  • table 2
  • figure 2
  • figure 3
  • figure 7
Is this relevant?
1995
1995
Eliminating the shortcomings of free datatype definitions
Free datatypes unify the concepts of enumeration types disjoint unions and re cursive types and are used for de ning new terms… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A New Approach for the Verification of Cache Coherence Protocols
We introduce a cache protocol verification technique based on a symbolic state expansion procedure. A global Finite State Machine… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?