基于表的编程。 [英] Table based programming.
问题描述
我希望这是一个认真，富有成效的主题。 Sabateurs将受到限制。
基于表格的编程是一种新的范例，类似于面向对象，程序分解或函数编程。
程序分解。 >
想法是程序中的所有数据都以表格形式出现。表格
由记录和字段组成，因此是一个2d条目。字段可以是
数字或字符串，并且具有名称，描述符，预验证条件
和后验证条件等。
请注意这一点表示表中的每个字段由data
字典描述。这本身就是一个表，每个字段都有一个记录。
表对磁盘缓存，共享，数据库
支持等完全透明。他们可以拥有大量的大量记录。
没有其他结构。队列，堆栈，树木等是你对表格做的事情，而不是表格的格式。想法是
，给定字典，你可以写自动编辑，观众，储户
等等。因此大多数代码都可以重用。它们的设计考虑了商业应用程序，但可以更广泛地使用。
现在显然C不是基于表格的编程语言。并没有建立
的支持。然而，范式与它们实现的语言无关。
我的问题是，设计一个TABLE是否切实可行。 C的图书馆？
-
免费游戏和编程好东西。
http://www.personal.leeds.ac.uk/~bgy1mm
Malcolm McLean写道：
我希望这是一个严肃的，富有成效的线索。 Sabateurs将受到限制。
基于表格的编程是一种新的范例，类似于面向对象，程序分解或函数编程。
程序分解。 >
想法是程序中的所有数据都以表格形式出现。表格
由记录和字段组成，因此是一个2d条目。字段可以是
数字或字符串，并且具有名称，描述符，预验证条件
和后验证条件等。
请注意这一点表示表中的每个字段由data
字典描述。这本身就是一个表，每个字段都有一个记录。
表对磁盘缓存，共享，数据库
支持等完全透明。他们可以拥有大量的大量记录。
没有其他结构。队列，堆栈，树木等是你对表格做的事情，而不是表格的格式。想法是
，给定字典，你可以写自动编辑，观众，储户
等等。因此大多数代码都可以重用。它们的设计考虑了商业应用程序，但可以更广泛地使用。
现在显然C不是基于表格的编程语言。并没有建立
的支持。然而，范式与它们实现的语言无关。
我的问题是，设计一个TABLE是否切实可行。 C的库？
嗯，
使用TABLE的现有方法并不简单用于C？
有许多SQL实现可以让你将所有数据存储在/某些表/表中。$ br />
Lothar
-
免费游戏和编程好东西。
http://www.personal.leeds.ac.uk/~bgy1mm
Malcolm McLean写道：
我希望这是一个认真，富有成效的主题。 Sabateurs将受到限制。
基于表格的编程是一种新的范例，类似于面向对象，程序分解或函数式编程。
。 >
想法是程序中的所有数据都以表格形式出现。表格
由记录和字段组成，因此是一个2d条目。字段可以是
数字或字符串，并且具有名称，描述符，预验证
条件和后验证条件等。
请注意这一点意味着表格中的每个字段都由一个
数据字典描述。这本身就是一个表，每个字段都有一个记录。
表对磁盘缓存，共享，数据库
支持等完全透明。他们可以拥有大量的大量记录。
没有其他结构。队列，堆栈，树木等都是你对表格做的事情，而不是表格的格式。
的想法是，给定字典，你可以写自动编辑器，
观众，储蓄者等等。因此大多数代码都可以重用。他们
的设计考虑了商业应用，但可以更广泛地使用
。
现在显然C不是基于表格的编程语言并且没有
构建支持。然而，范式与它们实现的语言无关。
我的问题是，设计TABLE是否切实可行？用于C的库？
您是否有使用xBASE表的经验，通常是.DBF文件？他们已经有近三十年的时间了，并且是dBASE，FoxPro，
Clipper，xHarbour等的基础。 al。
实用与否，它是可行的，也许是有趣的。
-
Joe Wright
所有东西都应尽可能简单，但不能简单。
---阿尔伯特爱因斯坦---
Malcolm McLean写道：
我希望这是一个认真，富有成效的主题。 Sabateurs将受到限制。
基于表格的编程是一种新的范例，类似于面向对象，程序分解或函数式编程。
。 >
一种编程语言
APL。
用这种计算机语言，由艾弗森提出一切都是一张桌子。
由于lisp对待列表，表格是APL的基本概念。
表本身是平行的，并且很好地适应于并行处理。
我正在根据
用于Linux和Windows的SIMD编程的想法准备改编APL。 Cockshott和Renfrew。
想法是程序中的所有数据都在表格中。表格
由记录和字段组成，因此是一个2d条目。字段可以是
数字或字符串，并且具有名称，描述符，预验证
条件和后验证条件等。
请注意这一点意味着表格中的每个字段都由一个
数据字典描述。它本身就是一个表，每个字段有一个记录。
表可以有不同的尺寸。
向量是一维的，然后你有2,3,4维表。
表格可以粗糙另外，如上所述。在这种情况下，我们有了指针表C.
表对磁盘缓存，共享，数据库完全透明
支持等。他们可以拥有大量的大量记录。
在VM系统中，这可以轻松完成，但我想基于RAM
方法。
没有其他结构。队列，堆栈，树木等都是你对表格做的事情，而不是表格的格式。
的想法是，给定字典，你可以写自动编辑器，
观众，储蓄者等等。因此大多数代码都可以重用。他们
的设计考虑了商业应用，但可以更广泛地使用
。
现在显然C不是基于表格的编程语言并且没有
构建支持。然而，范式与它们实现的语言无关。
我的问题是，设计TABLE是否切实可行？ C的库？
我这样做（慢慢地，因为我非常孤独）。
-
jacob navia
jacob at jacob point remcomp point fr
logiciels / informatique
http://www.cs.virginia.edu/~lcc-win32
I want this to be a serious, fruitful thread. Sabateurs will be plonked.
Table-based programming is a new paradigm, similar to object-orientation,
procedural decomposition, or functional programming.
The idea is that all the data in the program comes in "tables". A table
consists of records and fields, and is thus a 2d entry. Fields may be
numbers or strings, and have names, descriptors, prevalidation conditions
and postvalidation conditions, and the like.
Note that this means that each field in the table is described by a "data
dictionary" which is itself a table, with one record for each field.
Tables are completely transparent to disk caching, sharing, database
support, and the like. They can have tiny of massive numbers of records.
There are no other structures. Queues, stacks, trees and the like are things
that you do to tables, not the format that the table is in. The idea is
that, given a dictionary, you can write automatic editors, viewers, savers
and things like that. So most code can be reused. They are designed with
business applications in mind, but could be used more broadly.
Now obviously C is not a "table-based programming language" and has no build
in support. However paradigms are independent of the language they are
implemented in.
My question is, is it practical to design a "TABLE" library for C?
--
Free games and programming goodies.
http://www.personal.leeds.ac.uk/~bgy1mm
Malcolm McLean wrote:I want this to be a serious, fruitful thread. Sabateurs will be plonked.
Table-based programming is a new paradigm, similar to object-orientation,
procedural decomposition, or functional programming.
The idea is that all the data in the program comes in "tables". A table
consists of records and fields, and is thus a 2d entry. Fields may be
numbers or strings, and have names, descriptors, prevalidation conditions
and postvalidation conditions, and the like.
Note that this means that each field in the table is described by a "data
dictionary" which is itself a table, with one record for each field.
Tables are completely transparent to disk caching, sharing, database
support, and the like. They can have tiny of massive numbers of records.
There are no other structures. Queues, stacks, trees and the like are things
that you do to tables, not the format that the table is in. The idea is
that, given a dictionary, you can write automatic editors, viewers, savers
and things like that. So most code can be reused. They are designed with
business applications in mind, but could be used more broadly.
Now obviously C is not a "table-based programming language" and has no build
in support. However paradigms are independent of the language they are
implemented in.
My question is, is it practical to design a "TABLE" library for C?
Hmm,
is it not simpler to use existing approaches for TABLE''s used in C ?
There are many SQL implementation''s that let you store all your data
in a / some table / tables.
Lothar
--
Free games and programming goodies.
http://www.personal.leeds.ac.uk/~bgy1mm
Malcolm McLean wrote:I want this to be a serious, fruitful thread. Sabateurs will be plonked.
Table-based programming is a new paradigm, similar to
object-orientation, procedural decomposition, or functional programming.
The idea is that all the data in the program comes in "tables". A table
consists of records and fields, and is thus a 2d entry. Fields may be
numbers or strings, and have names, descriptors, prevalidation
conditions and postvalidation conditions, and the like.
Note that this means that each field in the table is described by a
"data dictionary" which is itself a table, with one record for each field.
Tables are completely transparent to disk caching, sharing, database
support, and the like. They can have tiny of massive numbers of records.
There are no other structures. Queues, stacks, trees and the like are
things that you do to tables, not the format that the table is in. The
idea is that, given a dictionary, you can write automatic editors,
viewers, savers and things like that. So most code can be reused. They
are designed with business applications in mind, but could be used more
broadly.
Now obviously C is not a "table-based programming language" and has no
build in support. However paradigms are independent of the language they
are implemented in.
My question is, is it practical to design a "TABLE" library for C?
Have you any experience with xBASE tables, usually .DBF files? They''ve
been around for nearly thirty years and are the basis for dBASE, FoxPro,
Clipper, xHarbour, et. al.
Practical or not, it is doable and perhaps interesting.
--
Joe Wright
"Everything should be made as simple as possible, but not simpler."
--- Albert Einstein ---
Malcolm McLean wrote:I want this to be a serious, fruitful thread. Sabateurs will be plonked.
Table-based programming is a new paradigm, similar to
object-orientation, procedural decomposition, or functional programming.
A Programming Language
APL.
In that computer language, proposed by Iverson, everything is a table.
As lisp treats lists, the table is the fundamental concept of APL.
Tables are inherently parallel, and well adapted to parallel processing.
I am preparing an adaptation of APL according to the ideas of
"SIMD programming for linux and windows" of Cockshott and Renfrew.
The idea is that all the data in the program comes in "tables". A table
consists of records and fields, and is thus a 2d entry. Fields may be
numbers or strings, and have names, descriptors, prevalidation
conditions and postvalidation conditions, and the like.
Note that this means that each field in the table is described by a
"data dictionary" which is itself a table, with one record for each field.
Tables can come in different dimensions.
Vectors are one dimensional, then you have 2, 3, 4 dimensional tables.
Tables can be "ragged" also, as you propose above. In that case we have
the pointer tables of C.
Tables are completely transparent to disk caching, sharing, database
support, and the like. They can have tiny of massive numbers of records.
In a VM system this can be done easily but I would suppose a RAM
based approach.
There are no other structures. Queues, stacks, trees and the like are
things that you do to tables, not the format that the table is in. The
idea is that, given a dictionary, you can write automatic editors,
viewers, savers and things like that. So most code can be reused. They
are designed with business applications in mind, but could be used more
broadly.
Now obviously C is not a "table-based programming language" and has no
build in support. However paradigms are independent of the language they
are implemented in.
My question is, is it practical to design a "TABLE" library for C?
I am doing it (slowly, because I am very much alone in this).
--
jacob navia
jacob at jacob point remcomp point fr
logiciels/informatique
http://www.cs.virginia.edu/~lcc-win32
这篇关于基于表的编程。的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
