FACTOID # 95: You can be imprisoned for not voting in Fiji, Chile and Egypt - at least in theory.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > A Sharp
The title given to this article is incorrect due to technical limitations. The correct title is A# programming language.
Contents

A# as part of the Axiom computer algebra system

A# (A sharp) is an object-oriented functional programming language distributed as a separable component of Version 2 of the Axiom computer algebra system. A# types and functions are first-class values and can be used freely in conjunction with an extensive library of data structures and other mathematical abstractions. A key design guideline for A# was suitability of compilation to portable and efficient machine code.


Development of A# has now switched to the Aldor programming language.


There is both an A# optimising compiler and an A# intermediate code interpreter. The compiler can produce any of:

Ports have been made to many different architectures (16, 32, and 64 bit):

And to several operating systems:

The following C compilers are supported: gcc, Xlc, Sun, Borland, Metaware and MIPS C.

This article was originally based on material from the Free On-line Dictionary of Computing, which is licensed under the GFDL.

A# as part of the .NET environment

A# is a port of the Ada programming language to the Microsoft .NET Platform. A# is freely distributed by the Department of Computer Science at the United States Air Force Academy as a service to the Ada community under the terms of the GNU general public license.


See http://www.usafa.af.mil/dfcs/bios/mcc_html/a_sharp.html.


  Results from FactBites:
 
Encyclopedia4U - Zero sharp - Encyclopedia Article (250 words)
(zero sharp, also: 0#) is an important large cardinal number.
In that case, the Covering Lemma holds: If x is an uncountable set of ordinals, then there is a constructible y ⊃ x such that y has the same cardinality as x.
Existence of zero sharp is equivalent to determinacy of lightface analytic games.
  More results at FactBites »


 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m