Module ACSpans.AbstractCurrySpan

This library contains a definition for representing Curry programs in Curry and an I/O action to read Curry programs and transform them into this abstract representation.

Note this defines a slightly new format for AbstractCurry in comparison to the first proposal of 2003.

Assumption: an abstract Curry program is stored in file with extension .acy

Author: Michael Hanus, Bjoern Peemoeller, Jan Tikovsky

Version: September 2016

Summary of exported operations:

version :: String   
Current version of AbstractCurry
preludeName :: String   
Type of case expressions The name of the standard prelude.
pre :: String -> (((Int,Int),(Int,Int)),String,String)   
Converts a string into a qualified name of the Prelude.

Exported datatypes:


MName

A module name.

Type synonym: MName = String


QName

The data type for representing qualified names. In AbstractCurry all names are qualified to avoid name clashes. The first component is the module name and the second component the unqualified name as it occurs in the source program. An exception are locally defined names where the module name is the empty string (to avoid name clashes with a globally defined name).

Type synonym: QName = (Span,MName,String)


CVisibility

Data type to specify the visibility of various entities.

Constructors:

  • Public :: CVisibility
  • Private :: CVisibility

CFixity

Data type for operator associativity

Constructors:

  • CInfixOp :: CFixity
  • CInfixlOp :: CFixity
  • CInfixrOp :: CFixity

CCaseType

Type of case expressions

Constructors:

  • CRigid :: CCaseType
  • CFlex :: CCaseType

CurryProg

Data type for representing a Curry module in the intermediate form. A value of this data type has the form

(CurryProg modname imports typedecls functions opdecls)

where modname: name of this module, imports: list of modules names that are imported, typedecls: Type declarations functions: Function declarations opdecls: Operator precedence declarations

Constructors:


CTypeDecl

Data type for representing definitions of algebraic data types and type synonyms.

A data type definition of the form

data t x1...xn = ...| c t1....tkc |...

is represented by the Curry term

(CType t v [i1,...,in] [...(CCons c kc v [t1,...,tkc])...])

where each ij is the index of the type variable xj.

Note: the type variable indices are unique inside each type declaration and are usually numbered from 0

Thus, a data type declaration consists of the name of the data type, a list of type parameters and a list of constructor declarations.

Constructors:


CTVarIName

The type for representing type variables. They are represented by (i,n) where i is a type variable index which is unique inside a function and n is a name (if possible, the name written in the source program).

Type synonym: CTVarIName = (Span,Int,String)


CConsDecl

A constructor declaration consists of the name of the constructor and a list of the argument types of the constructor. The arity equals the number of types.

Constructors:


CFieldDecl

A record field declaration consists of the name of the the label, the visibility and its corresponding type.

Constructors:


CTypeExpr

Type expression. A type expression is either a type variable, a function type, or a type constructor application.

Note: the names of the predefined type constructors are "Int", "Float", "Bool", "Char", "IO", "()" (unit type), "(,...,)" (tuple types), "[]" (list type)

Constructors:


CField

Labeled record fields

Type synonym: CField a = (QName,a)


COpDecl

Data type for operator declarations. An operator declaration "fix p n" in Curry corresponds to the AbstractCurry term (COp n fix p).

Constructors:


Arity

Data type for operator associativity Function arity

Type synonym: Arity = Int


CFuncDecl

Data type for representing function declarations.

A function declaration in AbstractCurry is a term of the form

(CFunc name arity visibility type (CRules eval [CRule rule1,...,rulek]))

and represents the function name defined by the rules rule1,...,rulek.

Note: the variable indices are unique inside each rule

Thus, a function declaration consists of the name, arity, type, and a list of rules.

A function declaration with the constructor CmtFunc is similarly to CFunc but has a comment as an additional first argument. This comment could be used by pretty printers that generate a readable Curry program containing documentation comments.

Constructors:


CRule

The general form of a function rule. It consists of a list of patterns (left-hand side) and the right-hand side for these patterns.

Constructors:


CRhs

Right-hand-side of a CRule or a case expression. It is either a simple unconditional right-hand side or a list of guards with their corresponding right-hand sides, and a list of local declarations.

Constructors:


CLocalDecl

Data type for representing local (let/where) declarations

Constructors:


CVarIName

Data types for representing object variables. Object variables occurring in expressions are represented by (Var i)--- where i is a variable index.

Type synonym: CVarIName = (Span,Int,String)


CPattern

Data type for representing pattern expressions.

Constructors:


CExpr

Data type for representing Curry expressions.

Constructors:


CLiteral

Data type for representing literals occurring in an expression. It is either an integer, a float, or a character constant.

Constructors:

  • CIntc :: Span -> Int -> CLiteral
  • CFloatc :: Span -> Float -> CLiteral
  • CCharc :: Span -> Char -> CLiteral
  • CStringc :: Span -> String -> CLiteral

CStatement

Data type for representing statements in do expressions and list comprehensions.

Constructors:


Exported operations:

version :: String   

Current version of AbstractCurry

Further infos:
  • solution complete, i.e., able to compute all solutions

preludeName :: String   

Type of case expressions The name of the standard prelude.

Further infos:
  • solution complete, i.e., able to compute all solutions

pre :: String -> (((Int,Int),(Int,Int)),String,String)   

Converts a string into a qualified name of the Prelude.

Further infos:
  • solution complete, i.e., able to compute all solutions