scientific article; zbMATH DE number 1531380

MaRDI QIDQ4513599zbMATH OpenFDO

Authors Pierre Valarcher

Publication date 28 February 2001

zbMATH Keywords

denotational semanticssystem \(T\)

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• A unary representation result for system \(T\)
• A geometry of interaction machine for Gödel's system T
• Intensionality, definability and computation
• Intensional aspects of function definitions
• Intensional computation with higher-order functions

Cites work

• A complete characterization of primitive recursive intensional behaviours
• A unary representation result for system \(T\)
• About primitive recursive algorithms
• Computing minimum with primitive recursion over lists
• Concrete domains
• scientific article; zbMATH DE number 4087627 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• LCF considered as a programming language
• On a hitherto unexploited extension of the finitary standpoint
• On the expressive power of the loop language
• Sequential algorithms on concrete data structures

Cited in

(9)

• A geometry of interaction machine for Gödel's system T
• Intensional computation with higher-order functions
• A unary representation result for system \(T\)
• An Interaction Net Encoding of Gödel’s System  $$\mathcal {T}$$
• Semantic investigation of canonical Gödel hypersequent systems
• An Intensional Semantics for Elementary Program Transformations
• scientific article; zbMATH DE number 7599980 (Why is no real title available?)
• Intensionality, definability and computation
• Intensional aspects of function definitions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513599)